#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma G++ optimize("O3")
using namespace std;
const double PI = acos(-1.0);
const int MAXN = 5e5 + 55;
const int INF = 0x3f3f3f3f;
const int NINF = 0x80808080;
const long long NLINF = 0x8080808080808080;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-6;
int n;
double a[MAXN];
vector<double> ans;
int check(double d) {
  ans.clear();
  ans.push_back(a[1] + d);
  double now = a[1] + 2 * d;
  for (int i = 1; i <= n; i++) {
    if (a[i] > now) {
      ans.push_back(a[i] + d);
      now = a[i] + 2 * d;
      if (ans.size() > 3) return 0;
    }
  }
  return 1;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf", &a[i]);
  sort(a + 1, a + 1 + n);
  if (n <= 3) {
    printf("0.000000\n");
    for (int i = 1; i <= n; i++) printf("%.6f ", a[i]);
    int dis = 3 - n;
    for (int i = 1; i <= dis; i++) printf("%.6f ", a[n]);
  } else {
    double l = 0, r = 1e9 + 7;
    while (l < r - eps) {
      double mid = (l + r) / 2.0;
      if (check(mid) == 0)
        l = mid + eps;
      else
        r = mid;
    }
    int ff = check(l);
    while (check(l) == 0) {
      l += eps;
    }
    check(l);
    printf("%.6f\n", l);
    for (auto x : ans) printf("%.6f ", x);
    int dis = 3 - ans.size();
    for (int i = 1; i <= dis; i++) printf("%.6f ", a[n]);
  }
}
