#include <bits/stdc++.h>
using namespace std;
int n;
double x[200010];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i];
  sort(x, x + n);
  double lo = 0, hi = 1e9;
  for (int i = 0; i < 70; i++) {
    double mi = (lo + hi) / 2;
    int cur = 0;
    for (int j = 0; j < 3; j++) {
      cur = upper_bound(x, x + n, x[cur] + mi * 2) - x;
      if (cur == n) break;
    }
    if (cur == n)
      hi = mi;
    else
      lo = mi;
  }
  cout << setprecision(11) << hi << endl;
  int cur = 0;
  for (int j = 0; j < 3; j++) {
    cout << x[cur] + hi << " ";
    cur = upper_bound(x, x + n, x[cur] + hi * 2) - x;
  }
}
