#include <bits/stdc++.h>
using namespace std;
const int lim = 2000000000;
int n, t[200010];
bool spr(double d) {
  double l1 = t[0] + d;
  if (l1 + d >= t[n - 1]) return 1;
  int pos = upper_bound(t, t + n, (int)(l1 + d)) - t;
  double l2 = t[pos] + d;
  if (l2 + d >= t[n - 1]) return 1;
  pos = upper_bound(t, t + n, (int)(l2 + d)) - t;
  double l3 = t[pos] + d;
  if (l3 + d >= t[n - 1]) return 1;
  return 0;
}
double BS(double p, double k) {
  double prev = p;
  while (true) {
    double s = (p + k) / 2.0;
    if (spr(s))
      k = s;
    else
      p = s;
    if (fabs(prev - s) < 0.0000000001) break;
    prev = s;
  }
  return k;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &t[i]);
  sort(t, t + n);
  double d = BS(0, t[n - 1] - t[0]);
  double l1 = t[0] + d, l2, l3;
  if (l1 + d >= t[n - 1]) {
    l2 = l3 = l1;
    printf("%.6lf\n%.6lf %.6lf %.6lf\n", d, l1, l2, l3);
    return 0;
  }
  int pos = upper_bound(t, t + n, (int)(l1 + d)) - t;
  l2 = t[pos] + d;
  if (l2 + d >= t[n - 1]) {
    l3 = l2;
    printf("%.6lf\n%.6lf %.6lf %.6lf\n", d, l1, l2, l3);
    return 0;
  }
  pos = upper_bound(t, t + n, (int)(l2 + d)) - t;
  l3 = t[pos] + d;
  printf("%.6lf\n%.6lf %.6lf %.6lf\n", d, l1, l2, l3);
  return 0;
}
