#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, k, m, n;
  int a[300000];
  double b[10];
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  double h, l;
  h = 0;
  l = a[n];
  while ((l - h) > 1e-8) {
    double mid = (h + l) / 2.0;
    k = 1;
    double j = a[1] + 2 * mid;
    i = upper_bound(a, a + n, j) - a;
    while (i <= n) {
      if (i == n && a[i] + 1e-8 < j) break;
      k++;
      j = a[i] + 2 * mid;
      if (k > 3) break;
      i = upper_bound(a, a + n, j) - a;
    }
    if (k <= 3)
      l = mid;
    else
      h = mid;
  }
  double mid = l;
  k = 1;
  double j = a[1] + 2 * mid;
  b[k] = a[1] + mid;
  for (i = 1; i <= n; i++)
    if (a[i] > j + 1e-8) {
      k++;
      b[k] = a[i] + mid;
      j = a[i] + 2 * mid;
    }
  if (k == 1) b[2] = b[1], b[3] = b[2];
  if (k == 2) b[3] = b[2];
  printf("%.6lf\n", l);
  for (i = 1; i < 3; i++) printf("%.6lf ", b[i]);
  printf("%.6lf\n", b[i]);
}
