#include <bits/stdc++.h>
using namespace std;
const double eps = 0.000000001;
double x[300000];
double p[3];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%lf", &x[i]);
  sort(x, x + n);
  int j;
  bool q;
  double l = 0, r = 1000 * 1000 * 1000, m;
  while ((r - l - 0.000001) > eps) {
    m = (r + l) / 2;
    j = 0;
    q = false;
    p[0] = x[0] + m;
    for (int i = 1; i < n; i++)
      if (abs(p[j] - x[i]) - m > eps) {
        if (j == 2) {
          q = true;
          break;
        }
        j++;
        p[j] = x[i] + m;
      }
    if (q)
      l = m;
    else
      r = m;
  }
  m = ((double)trunc(r * 1000000)) / 1000000;
  j = 0;
  p[0] = x[0] + m;
  for (int i = 1; i < n; i++)
    if (abs(p[j] - x[i]) - m > eps) {
      j++;
      p[j] = x[i] + m;
    }
  while (j < 2) p[++j] = 0;
  printf("%.6lf\n", m);
  for (int i = 0; i < 3; i++) printf("%.6lf ", p[i]);
  printf("\n");
  return 0;
}
