#include <bits/stdc++.h>
using namespace std;
double a[200000];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  int count1 = 1, count2 = 2;
  if (n == 1) {
    cout << 0 << endl << a[0] << ' ' << a[0] << ' ' << a[0];
    return 0;
  }
  if (n == 2) {
    cout << 0 << endl << a[0] << ' ' << a[0] << ' ' << a[1];
    return 0;
  }
  if (n == 3) {
    cout << 0 << endl << a[0] << ' ' << a[1] << ' ' << a[2];
    return 0;
  }
  double r = (a[n - 1] - a[count2]);
  bool doit = false;
  do {
    doit = false;
    if (count2 < n - 1) {
      if ((a[count2] - a[count1]) <= r) {
        count2++;
        doit = true;
      }
    }
    if (!doit && count2 - count1 > 1) {
      if ((a[count1] - a[0]) <= r) {
        count1++;
        doit = true;
      }
    }
    if (!doit && count2 < n - 1) {
      if ((a[count1] - a[0]) <= r && (a[count2] - a[count1 + 1]) <= r) {
        count1++;
        count2++;
        doit = true;
      }
    }
    r = max((a[count1 - 1] - a[0]),
            max((a[count2 - 1] - a[count1]), (a[n - 1] - a[count2])));
  } while (doit);
  r /= 2;
  printf("%.6f\n%.6f %.6f %.6f", r, a[0] + r, a[count1] + r, a[count2] + r);
  return 0;
}
