#include <bits/stdc++.h>
using namespace std;
int a[200005], n;
double ans[3];
const double eps = 1e-10;
bool check(double r) {
  ans[0] = a[0] + r;
  ans[2] = a[n - 1] - r;
  int lo = 0, hi = n, L, R;
  while (lo + 1 < hi) {
    int m = (lo + hi) / 2;
    if (a[m] < ans[0] + r + eps)
      lo = m;
    else
      hi = m;
  }
  L = lo + 1;
  lo = -1, hi = n - 1;
  while (lo + 1 < hi) {
    int m = (lo + hi) / 2;
    if (a[m] > ans[2] - r - eps)
      hi = m;
    else
      lo = m;
  }
  R = hi - 1;
  if (L > R) {
    ans[1] = a[0];
    return 1;
  }
  ans[1] = (a[R] + a[L]) / 2.0;
  if (a[R] - a[L] > 2 * r + eps) return 0;
  return 1;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a, a + n);
  if (n <= 3) {
    printf("%.10f\n", 0.0);
    for (int i = 0; i < 3; i++)
      printf("%.10f%c", 1.0 * a[min(i, n - 1)], i == 2 ? '\n' : ' ');
    return 0;
  }
  double lo = 0, hi = (a[n - 1] - a[0]) / 2.0;
  for (int i = 0; i < 200; i++) {
    double m = (lo + hi) / 2;
    if (check(m))
      hi = m;
    else
      lo = m;
  }
  check(hi);
  printf("%.10f\n", hi);
  for (int i = 0; i < 3; i++) printf("%.10f%c", ans[i], i == 2 ? '\n' : ' ');
  return 0;
}
