#include <bits/stdc++.h>
using namespace std;
vector<long double> arr;
int n, ans;
long double l = 0, r = 999999999999;
long double lm = 0;
int x, y;
bool valid(long double d) {
  if (arr[arr.size() - 1] - 2 * d <= arr[0]) return true;
  x = *(lower_bound(arr.begin(), arr.end(), arr[arr.size() - 1] - 2 * d) - 1);
  y = *upper_bound(arr.begin(), arr.end(), arr[0] + 2 * d);
  if ((x - y) <= 2 * d) {
    return true;
  } else
    return false;
}
int main() {
  cin >> n;
  for (size_t i = 0; i < n; i++) {
    cin >> x;
    arr.push_back(x);
  }
  sort(arr.begin(), arr.end());
  r = arr[n - 1];
  l = 0;
  while (true) {
    long double mid = (l + r) / 2;
    if (abs(l - r) < 0.0000001) break;
    if (valid(mid)) {
      r = mid;
    } else {
      l = mid;
    }
    lm = r;
  }
  cout << fixed << setprecision(6) << (lm) << endl;
  cout << fixed << setprecision(6) << (long double)arr[0] + lm << " ";
  long double xx = (long double)arr[0] + lm;
  int i = 0, cnt = 1;
  for (size_t i = 0; i < n; i++) {
    if (arr[i] > xx + lm) {
      xx = arr[i] + lm;
      cout << fixed << setprecision(6) << (long double)arr[i] + lm << " ";
      cnt++;
    }
  }
  for (; cnt < 3; cnt++) cout << "0 ";
  cout << endl;
  return 0;
}
