#include <bits/stdc++.h>
using namespace std;
int x[200005];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> x[i];
  sort(x + 1, x + 1 + n);
  double l = 0, r = 1e9;
  double E = 1e-9;
  double st[5];
  double ans[5];
  x[n + 1] = 2e9 + 3;
  while (l + E <= r) {
    double mid = (l + r) / 2;
    int pos = 1;
    int cnt = 0;
    while (pos <= n && cnt <= 2) {
      cnt++;
      st[cnt] = x[pos] + mid;
      while (abs(st[cnt] - x[pos]) <= mid + E) {
        pos++;
      }
    }
    if (pos <= n)
      l = mid + E;
    else {
      r = mid;
      for (int i = 1; i <= 3; i++) ans[i] = st[i];
    }
  }
  cout << fixed << setprecision(6) << l << "\n";
  for (int i = 1; i <= 3; i++) {
    cout << fixed << setprecision(6) << ans[i] << " ";
  }
}
