#include <bits/stdc++.h>
using namespace std;
int n;
double num[200004], a1, a2, a3, ans;
int cmp(double x) { return x > 1e-10 ? 1 : x < -1e-10 ? -1 : 0; }
int test(double x) {
  int re1, re2, i;
  a1 = num[1] + x;
  a3 = num[n] - x;
  for (i = 2; i <= n; i++) {
    if (cmp(num[i] - num[1] - 2 * x) > 0) break;
  }
  re1 = i;
  for (i = n - 1; i >= 1; i--) {
    if (cmp(num[n] - num[i] - 2 * x) > 0) break;
  }
  re2 = i;
  if (cmp(num[re2] - num[re1] - 2 * x) <= 0) {
    a2 = num[re1] + x;
    return 1;
  }
  return 0;
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 1; i <= n; i++) scanf("%lf", &num[i]);
    sort(num + 1, num + n + 1);
    double l, r, mid;
    l = 0;
    r = 1e10;
    int time = 200;
    while (time--) {
      mid = (l + r) / 2;
      if (test(mid)) {
        ans = mid;
        r = mid;
      } else {
        l = mid;
      }
    }
    printf("%.6lf\n", ans);
    printf("%.6lf %.6lf %.6lf\n", a1, a2, a3);
  }
  return 0;
}
