#include <bits/stdc++.h>
using namespace std;
int n;
long long arr[1000000];
double lo, hi = 1000000000, mid, d, cur, c, f, s, t;
bool ok(double mid) {
  cur = arr[0] + mid;
  for (int i = 0; i < 3; i++) {
    c = *upper_bound(arr, arr + n, cur);
    if (c != 0)
      cur = c + mid;
    else
      return 1;
  }
  return 0;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  for (int i = 0; i < 1000; i++) {
    mid = (hi + lo) / 2;
    if (ok(mid))
      hi = mid;
    else
      lo = mid;
  }
  f = arr[0];
  s = *upper_bound(arr, arr + n, arr[0] + mid);
  t = *upper_bound(arr, arr + n, s + mid);
  printf("%.6f\n", mid / 2);
  printf("%.6f %.6f %.6f", f + mid / 2, s + mid / 2, t + mid / 2);
  return 0;
}
