#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
int f_min(int x, int y) { return x < y ? x : y; }
int f_max(int x, int y) { return x > y ? x : y; }
void f_swap(int &x, int &y) {
  int t;
  t = x, x = y, y = t;
}
int f_abs(int x) { return x > 0 ? x : -x; }
int a[2001001];
int n;
double x[10];
int f(int val) {
  int l = 0, r = n - 1, mid;
  mid = 0;
  if (l == r) return r + 1;
  while (r - l > 1) {
    mid = (l + r) / 2;
    if (a[mid] > val)
      r = mid;
    else
      l = mid;
  }
  if (a[r] <= val) return r + 1;
  if (a[l] > val) return l;
  if (a[mid] > val) return mid;
  return r;
}
bool run(int val) {
  int i;
  int t = 0;
  x[0] = 0, x[1] = 0, x[2] = 0;
  for (i = 0; i < 3; i++) {
    x[i] = a[t] + val * 1.0 / 2;
    t = f(a[t] + val);
    if (t >= n) return true;
  }
  return false;
}
int find() {
  int l = 0, r = 2000000000, mid;
  while (r - l > 1) {
    mid = (r + l) / 2;
    if (run(mid))
      r = mid;
    else
      l = mid;
  }
  if (run(l)) return l;
  if (run(mid)) return mid;
  return r;
}
int main() {
  int i;
  while (~scanf("%d", &n)) {
    for (i = 0; i < n; i++) scanf("%d", &a[i]);
    sort(a, a + n);
    int ans = find();
    run(ans);
    printf("%.6lf\n%.6lf %.6lf %.6lf\n", ans * 1.0 / 2, x[0], x[1], x[2]);
  }
  return 0;
}
