#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int n;
vector<long long> a(200013);
bool f(long long m) {
  long long l = (long long)(a[0] + 2 * m), r = (long long)(a[n - 1] - 2 * m);
  if (l >= r) {
    return 1;
  }
  if ((r - l) <= 2 * m) {
    return 1;
  }
  long long ll =
      a[int(upper_bound(a.begin(), a.begin() + n, l) - a.begin())] + 2 * m;
  long long rr = a[int(upper_bound(a.begin(), a.begin() + n, ll) - a.begin())];
  if (rr == 0) {
    return 1;
  }
  return (rr >= r);
}
int main() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    a[i] *= 2;
  }
  sort(a.begin(), a.begin() + n);
  long long l = 0, r = 2000000000;
  while (l + 1 < r) {
    long long m = (l + r) / 2;
    if (!f(m)) {
      l = m;
    } else {
      r = m;
    }
  }
  if (!f(l)) l++;
  cout.setf(ios::fixed);
  cout.precision(6);
  cout << (double)l / 2.0 << endl
       << (double)(a[0] + l) / 2.0 << ' ' << (double)(a[n - 1] - l) / 2.0
       << ' ';
  long long ll = (long long)(a[0] + 2 * l);
  long long lll = a[int(upper_bound(a.begin(), a.begin() + n, ll) - a.begin())];
  cout << (double)(lll + l) / 2.0;
  return 0;
}
