#include <bits/stdc++.h>
using namespace std;
int n;
long long pos[100];
vector<long long> x(200005);
bool ok(long long p) {
  pos[0] = x[0] + p;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (x[i] > pos[cnt] + p) pos[++cnt] = x[i] + p;
  }
  return cnt <= 2;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
    x[i] *= 1e6;
  }
  sort(x.begin(), x.begin() + n);
  long long lo = 0, hi = x[n - 1], mid;
  while (hi - lo > 1) {
    mid = (hi + lo) / 2;
    if (ok(mid))
      hi = mid;
    else
      lo = mid;
  }
  lo += 3;
  while (ok(lo) && lo) lo--;
  if (lo) lo++;
  ok(lo);
  printf("%.6f\n", (double)lo / 1e6);
  printf("%.6f %.6f %.6f", (double)pos[0] / 1e6, (double)pos[1] / 1e6,
         (double)pos[2] / 1e6);
  return 0;
}
