#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:20000000")
using namespace std;
long n, i;
double m, p1, p2, maxx, minn, r, l;
long ar[1000000];
int main() {
  cin >> n;
  cout.precision(6);
  for (i = 0; i < n; i++) {
    cin >> ar[i];
  }
  sort(ar, ar + n);
  l = 0;
  r = 2000000000;
  while (r - l > 0.01) {
    m = (l + r) / 2;
    p1 = ar[0] + 2 * m;
    p2 = ar[n - 1] - 2 * m;
    minn = 1100000000;
    maxx = -1100000000;
    for (i = 0; i < n; i++) {
      if (ar[i] > p1 && ar[i] < p2) {
        if (ar[i] < minn) minn = ar[i];
        if (ar[i] > maxx) maxx = ar[i];
      };
    }
    if (maxx - minn > 2100000000 || maxx - minn < 2 * m) {
      r = m;
    } else
      l = m;
    ;
  }
  long lq = m * 2 + 0.1;
  m = lq * 0.5;
  cout << fixed << m << endl << ar[0] + m;
  minn = 1100000000;
  for (i = 0; i < n; i++)
    if (ar[i] > ar[0] + 2 * m + 0.00000001 && ar[i] < minn) minn = ar[i];
  if (minn > 1000000000) minn = ar[0];
  cout << " " << minn + m << " " << ar[n - 1] - m << endl;
  cin.get();
  cin.get();
  cin.get();
  return 0;
}
