#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
long long n, t, a[N], b, x, k;
set<pair<long long, long long> > s;
inline bool check(long long d) {
  long long p = 0;
  long long x = a[0] + d;
  while (a[p] <= x && p < n - 1) p++;
  long long x1 = a[p] + d;
  while (a[p] <= x1 && p < n - 1) p++;
  long long x2 = a[p] + d;
  while (a[p] <= x2 && p < n) p++;
  if (p >= n)
    return 1;
  else
    return 0;
}
int main() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  long long r = 1e10;
  long long l = -1;
  while (r - l > 1) {
    long long mid = (l + r) / 2;
    if (check(mid) == 1) {
      r = mid;
    } else
      l = mid;
  }
  long long p = 0;
  cout << fixed << setprecision(6) << (long double)r / 2 << endl
       << (long double)a[0] + (long double)r / 2 << " ";
  while (a[p] <= a[0] + r && p < n - 1) p++;
  cout << fixed << setprecision(6) << (long double)a[x = p] + (long double)r / 2
       << " ";
  while (a[p] <= a[x] + r && p < n - 1) p++;
  cout << fixed << setprecision(6) << (long double)a[p] + (long double)r / 2
       << " ";
  return 0;
}
