#include <bits/stdc++.h>
using namespace std;
double l, r, d;
vector<double> x, k, res;
int n;
int main() {
  cin >> n;
  k.resize(n);
  for (int i = 0; i < n; i++) cin >> k[i];
  sort(k.begin(), k.end());
  x.push_back(k[0]);
  for (int i = 1; i < k.size(); i++)
    if (k[i] != k[i - 1]) x.push_back(k[i]);
  double l = 0, r = x[x.size() - 1] - x[0], m;
  while (r - l >= 0.000000001) {
    m = (l + r) / 2.0;
    res.clear();
    for (int i = 0; i < x.size(); i++) {
      res.push_back(x[i] + m);
      int j = i;
      while (j < x.size() && x[j] - res[res.size() - 1] <= m) j++;
      i = j - 1;
    }
    if (res.size() <= 3)
      r = m + 0.0000000001;
    else
      l = m;
  }
  m = r;
  res.clear();
  for (int i = 0; i < x.size(); i++) {
    res.push_back(x[i] + m);
    int j = i;
    while (j < x.size() && x[j] - res[res.size() - 1] - m <= 0) j++;
    i = j - 1;
  }
  while (res.size() < 3) res.push_back(1);
  printf("%.9f\n%.9f %.9f %.9f", m, res[0], res[1], res[2]);
}
