#include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1000 * 100 + 10;
double d[maxn];
double a[maxn];
int n;
bool check(double x) {
  int y = 0, k = 0, xa;
  while (y < n && k < 3) {
    xa = y;
    y = lower_bound(a, a + n, a[y] + 2 * x) - a;
    if (a[xa] + 2 * x == a[y]) y++;
    k++;
  }
  if (a[xa] + 2 * x >= a[n - 1]) return 1;
  return 0;
}
double ans1, ans2, ans3;
int as, bs, cs;
void check1(double x) {
  ans1 = a[0] + x;
  as = lower_bound(a, a + n, ans1 + x) - a;
  ans2 = a[as] + x;
  bs = lower_bound(a, a + n, ans2 + x) - a;
  if (bs == n)
    ans3 = a[n - 1] + x;
  else
    ans3 = a[bs] + x;
}
double help(double s, double b) {
  double u = (b + s) / 2;
  if (b - s < 0.000001) {
    if (check(s) == 1) return s;
    return b;
  }
  if (check(u) == 0) return help(u, b);
  if (check(u) == 1) return help(s, u);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  double ans = help(0, 1000 * 1000 * 1000);
  if (ans == 0) {
    cout << 0 << endl;
    cout << fixed;
    cout << setprecision(6) << a[0] << " " << a[1] << " " << a[2] << endl;
  } else {
    cout << fixed << setprecision(6) << ans << endl;
    check1(ans);
    cout << ans1 << " " << ans2 << " " << ans3 << endl;
  }
  return 0;
}
