#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
int n, tot;
double l, r, mid, x[200000], posnow[200000];
int cmp(double a, double b) {
  if (fabs(a - b) < eps) return 0;
  if (a < b) return -1;
  return 1;
}
bool check(double dis) {
  tot = 0;
  posnow[tot++] = x[0] + dis;
  for (int i = 0; i < n; i++)
    if (cmp(fabs(x[i] - posnow[tot - 1]), dis) > 0) posnow[tot++] = x[i] + dis;
  return tot <= 3;
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) scanf("%lf", &x[i]);
    sort(x, x + n);
    l = 0.0;
    r = (double)(x[n - 1] - x[0]) / 6.0;
    for (int tims = 0; tims < 100; tims++) {
      mid = (l + r) / 2;
      if (check(mid) == true)
        r = mid;
      else
        l = mid;
    }
    printf("%.6f\n", l);
    tot = 0;
    posnow[tot++] = x[0] + r;
    for (int i = 0; i < n; i++)
      if (cmp(fabs(x[i] - posnow[tot - 1]), r) > 0) {
        posnow[tot++] = x[i] + r;
      }
    if (tot < 3)
      for (int i = tot; i < 3; i++) posnow[i] = posnow[tot - 1];
    for (int i = 0; i < 3; i++) printf("%.6f ", posnow[i]);
    printf("\n");
  }
  return 0;
}
