#include <bits/stdc++.h>
using namespace std;
double ans[3], temp[3];
int a[200200];
int n;
bool f(double d) {
  double x = 0;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (x < a[i]) {
      if (cnt == 3) return false;
      x = a[i] + 2 * d;
      temp[cnt++] = a[i] + d;
    }
  }
  for (int i = 0; i < 3; i++) ans[i] = temp[i];
  return true;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  double ul = 0, ur = a[n - 1];
  for (int k = 0; k < 400; k++) {
    double mid = (ul + ur) / 2;
    if (f(mid))
      ur = mid;
    else
      ul = mid;
  }
  printf("%.6f\n", ul);
  printf("%.6f %.6f %.6f\n", ans[0], ans[1], ans[2]);
  return 0;
}
