#include <bits/stdc++.h>
using namespace std;
int n;
long double x[200005];
vector<long double> v;
bool solve(long double in) {
  v.clear();
  long double p = x[0] + in;
  int cnt = 2;
  v.push_back(p);
  for (int i = 1; i < n && cnt >= 0; i++) {
    if (x[i] - p > in) {
      p = x[i] + in;
      v.push_back(p);
      cnt--;
    }
  }
  return cnt >= 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i];
  sort(x, x + n);
  long double low = 0, mid, high = x[n - 1];
  for (int i_i = 0; i_i < 100; i_i++) {
    mid = (low + high) / 2.0;
    if (solve(mid) == 1)
      high = mid;
    else
      low = mid;
  }
  cout << fixed << setprecision(6) << mid << endl;
  cout << fixed << setprecision(6) << v[0] << " "
       << v[min(1, (int)v.size() - 1)] << " " << v[min(2, (int)v.size() - 1)];
  return 0;
}
