#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
const double eps = 1e-6;
int n;
double a[maxn];
double x[5], sx[5];
bool check(double mid) {
  int s = 1;
  for (int i = 1; i <= 3; ++i) {
    sx[i] = a[s];
    s = upper_bound(a + 1, a + n + 1, a[s] + mid * 2) - a;
    if (s > n) return 1;
  }
  return s > n;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lf", &a[i]);
  sort(a + 1, a + n + 1);
  if (check(0.0)) {
    for (int i = 1; i <= 3; ++i) x[i] = sx[i];
    double as = 0;
    printf("%.6f\n", as);
    for (int i = 1; i <= 3; ++i) printf("%.6f ", x[i] + as);
    return 0;
  }
  double l = 0, r = a[n], ans;
  while (r - l > eps) {
    double mid = (l + r) / 2;
    if (check(mid)) {
      r = mid, ans = mid;
      for (int i = 1; i <= 3; ++i) x[i] = sx[i];
    } else
      l = mid;
  }
  printf("%.6f\n", ans);
  for (int i = 1; i <= 3; ++i) printf("%.6f ", x[i] + ans);
  return 0;
}
