#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int n, arr[MAX];
bool Can(double x) {
  double lastPos = arr[0] + x;
  int cnt = 1;
  for (int i = 1; i < n; i++) {
    if (abs(arr[i] - lastPos) > x) {
      ++cnt;
      lastPos = arr[i] + x;
    }
  }
  if (cnt <= 3) return true;
  return false;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  Can(0.5);
  int iter = 1000;
  double st = 0, en = arr[n - 1];
  while (--iter) {
    double mid = (st + en) * 0.5;
    if (Can(mid))
      en = mid;
    else
      st = mid;
  }
  cout << fixed << setprecision(6) << st << endl;
  int cnt = 1;
  double firstPos = arr[0] + st;
  cout << firstPos << " ";
  auto it = upper_bound(arr, arr + n, arr[0] + 2 * st + 1e-6);
  if (it == arr + n)
    cout << arr[n - 1] - st << " ";
  else
    cout << *it + st << " ";
  cout << arr[n - 1] - st;
  return 0;
}
