#include <bits/stdc++.h>
using namespace std;
vector<double> x;
int n;
bool good(double s) {
  int t = 0, c = 0;
  while (t < n && c < 3) {
    t = upper_bound(x.begin(), x.end(), x[t] + 2 * s + 1e-7) - x.begin();
    c++;
  }
  return t >= n;
}
int main() {
  scanf("%d", &n);
  x.resize(n + 1);
  for (int i = 0, _n = (n); i < _n; i++) scanf("%lf", &x[i]);
  x[n] = 1e11;
  sort(x.begin(), x.end());
  double l = 0, h = 1e9;
  while (h - l > 1e-7) {
    double m = (l + h) / 2.0;
    if (good(m))
      h = m;
    else
      l = m;
  }
  printf("%lf\n", l);
  int t = 0, c = 0;
  while (t < n && c < 3) {
    printf("%.6lf ", x[t] + l);
    t = upper_bound(x.begin(), x.end(), x[t] + 2 * l + 1e-6) - x.begin();
    c++;
  }
  if (c < 3)
    for (int i = (c), _b = (3); i < _b; i++) printf("%.6lf ", x[n - 1]);
  return 0;
}
