#include <bits/stdc++.h>
using namespace std;
int x[222222], n;
double d, x1, x2, x3, l, r, md;
bool check(double d) {
  bool f;
  int ps;
  x1 = x[1] + d;
  double xx = x1 + d;
  ps = 0, f = 0;
  for (int i = 1; i <= n; i++)
    if (xx - x[i] < -1e-9) {
      ps = i, f = 1;
      break;
    }
  if (!f) {
    x2 = x3 = x1;
    return 1;
  } else
    x2 = x[ps] + d, xx = x2 + d;
  f = 0;
  for (int i = ps; i <= n; i++)
    if (xx - x[i] < -1e-9) {
      ps = i, f = 1;
      break;
    }
  if (!f) {
    x3 = x2;
    return 1;
  } else
    x3 = x[ps] + d, xx = x3 + d;
  f = 0;
  for (int i = ps; i <= n; i++)
    if (xx - x[i] < -1e-9) {
      f = 1;
      break;
    }
  return !f;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
  sort(x + 1, x + 1 + n);
  if (n == 1) {
    printf("0\n%.6lf %.6lf %.6lf\n", (double)x[1], (double)x[1], (double)x[1]);
    return 0;
  }
  if (n == 2) {
    printf("0\n%.6lf %.6lf %.6lf\n", (double)x[1], (double)x[1], (double)x[2]);
    return 0;
  }
  if (n == 3) {
    printf("0\n%.6lf %.6lf %.6lf\n", (double)x[1], (double)x[2], (double)x[3]);
    return 0;
  }
  l = 0, r = 2000000002.0;
  for (int ii = 0; ii < 1000; ii++) {
    md = (l + r) / 2.;
    if (check(md))
      r = md;
    else
      l = md + 1e-9;
  }
  if (!check(l)) l += 1e-6, check(l);
  printf("%.6lf\n%.6lf %.6lf %.6lf\n", l, x1, x2, x3);
  return 0;
}
