#include <bits/stdc++.h>
using namespace std;
int n, i;
double l, r, m, a, b, c, x[300000];
bool Less(double k) {
  a = b = c = x[0] + k;
  for (i = 0; i < n; i++) {
    if (a + k < x[i]) break;
  }
  b = x[i] + k;
  for (; i < n; i++) {
    if (b + k < x[i]) break;
  }
  c = x[i] + k;
  for (; i < n; i++) {
    if (c + k < x[i]) break;
  }
  if (i == n) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  double t = clock();
  cin >> n;
  for (i = 0; i < n; i++) cin >> x[i];
  sort(x, x + n);
  l = 0;
  r = 1000000000;
  while (clock() - t < 930.0) {
    m = (l + r) / 2.0;
    if (Less(m))
      l = m;
    else
      r = m;
  }
  Less(r);
  cout << fixed << setprecision(6) << l << endl;
  cout << fixed << setprecision(6) << a << " " << b << " " << c;
  return 0;
}
