#include <bits/stdc++.h>
using namespace std;
int n, A[2 * 100005];
double B[5];
bool ok(double x) {
  int counter = 2;
  double v = A[0] + (2 * x);
  for (int i = 1; i < n; ++i) {
    if (A[i] > v) {
      --counter;
      v = A[i] + (2 * x);
    }
  }
  if (counter < 0) {
    return false;
  } else {
    return true;
  }
}
double binarySearch() {
  double lo = 0, med, hi = 1e9;
  int cnt = 100;
  while (cnt--) {
    med = ((lo + hi) / 2);
    if (ok(med))
      hi = med;
    else
      lo = med;
  }
  return med;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> A[i];
  }
  sort(A, A + n);
  double res = binarySearch();
  cout << fixed << setprecision(6) << res << endl;
  B[0] = A[0] + res;
  for (int i = 1, j = 0; i < n; ++i) {
    if (A[i] > (B[j] + res)) {
      B[j + 1] = A[i] + res;
      ++j;
    }
  }
  cout << fixed << setprecision(6) << B[0] << " " << B[1] << " " << B[2]
       << endl;
  return 0;
}
