#include <bits/stdc++.h>
using namespace std;
int n, x[200000];
bool check(double d) {
  int cur = 0;
  double good;
  for (int i = 0; i < 3; i++) {
    good = x[cur] + 2 * d;
    while (x[cur] <= good && cur < n) cur++;
  }
  if (cur < n)
    return false;
  else
    return true;
}
void write_ans(double d) {
  int cur = 0;
  double good;
  for (int i = 0; i < 3; i++) {
    printf("%.6lf ", x[cur] + d);
    good = x[cur] + 2 * d;
    while (x[cur] <= good && cur < n) cur++;
  }
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d", &x[i]);
  sort(x, x + n);
  double l = 0, r = 1e9, m;
  while (r - l > 1e-7) {
    m = (r + l) / 2;
    if (check(m))
      r = m;
    else
      l = m;
  }
  printf("%.6lf\n", r);
  write_ans(r);
  return 0;
}
