#include <bits/stdc++.h>
using namespace std;
const int maxn = 222222;
int x[maxn];
double ans[3];
int n;
bool yes(double d) {
  double temp[3];
  int m = 0;
  double sum = 0;
  temp[0] = temp[1] = temp[2] = x[n - 1] - d;
  for (int i = 1; i < n; i++) {
    sum += x[i] - x[i - 1];
    if (sum > d * 2) {
      if (m == 2) return false;
      sum -= x[i] - x[i - 1];
      temp[m++] = max(0.0, x[i - 1] - d);
      sum = 0;
    }
  }
  for (int i = 0; i < 3; i++) {
    ans[i] = temp[i];
  }
  return true;
}
int main() {
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &x[i]);
    }
    sort(x, x + n);
    double lo = 0;
    double hi = 1e9;
    int T = 100;
    while (T--) {
      double mid = (lo + hi) / 2;
      if (yes(mid))
        hi = mid;
      else
        lo = mid;
    }
    printf("%.6lf\n", lo);
    for (int i = 0; i < 3; i++) {
      printf("%lf%c", ans[i], i == 2 ? '\n' : ' ');
    }
  }
  return 0;
}
