#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 10;
int n, a[maxN];
long double res[3];
bool check(long double x) {
  int i;
  for (i = 0; i < n; i++)
    if (a[i] > 2 * x + a[0]) break;
  res[0] = a[0] + x;
  int last = i;
  for (i; i < n; i++)
    if (a[i] > 2 * x + a[last]) break;
  res[1] = a[last] + x;
  last = i;
  for (i; i < n; i++)
    if (a[i] > 2 * x + a[last]) break;
  res[2] = a[last] + x;
  return (i >= n);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  if (n < 4)
    return cout << 0 << '\n' << a[0] << " " << a[1] << " " << a[2] << '\n', 0;
  long double l = 0, r = 1e14;
  for (int i = 0; i < 200; i++) {
    long double mid = (l + r) / 2;
    if (check(mid))
      r = mid;
    else
      l = mid;
  }
  cout << fixed << setprecision(10);
  if (check(double(r - 0.5)))
    cout << (double)r - 0.5 << '\n'
         << res[0] << " " << res[1] << " " << res[2] << '\n';
  else {
    check(r);
    cout << r << '\n' << res[0] << " " << res[1] << " " << res[2] << '\n';
  }
  return 0;
}
