#include <bits/stdc++.h>
using namespace std;
long long int a[200001], n;
double temp[10], ans[10];
int ok(double d) {
  long long int cur = 0, i;
  for (i = 0; i < 3; i++) {
    temp[i] = a[cur] + d;
    cur = lower_bound(a, a + n, a[cur] + 2 * d + 1e-9) - a;
    if (cur >= n) break;
  }
  if (cur >= n)
    for (i = 0; i < 3; i++) ans[i] = temp[i];
  return cur >= n;
}
int main() {
  cout << fixed << setprecision(6);
  long long int i, j;
  double lo, hi, mid;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  lo = 0;
  hi = a[n - 1];
  for (i = 0; i < 200; i++) {
    mid = (lo + hi) / 2;
    if (ok(mid))
      hi = mid;
    else
      lo = mid;
  }
  cout << hi << endl;
  for (i = 0; i < 3; i++) cout << ans[i] << " ";
  return 0;
}
