#include <bits/stdc++.h>
using namespace std;
int arr[200005];
double p[4];
int n;
bool isok(double x) {
  double start = arr[0] + x;
  p[0] = start;
  int curr = 1;
  int index = 1;
  while (index < n) {
    if (arr[index] > start + x) {
      start = arr[index] + x;
      p[curr++] = start;
    }
    index++;
    if (curr == 4) {
      return false;
    }
  }
  return true;
}
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  double l = 0, r = 1e9;
  int time = 100;
  double mid;
  while (time--) {
    mid = (l + r) / 2;
    if (isok(mid)) {
      r = mid;
    } else {
      l = mid;
    }
  }
  cout << fixed << setprecision(6);
  cout << r << "\n";
  cout << p[0] << " " << p[1] << " " << p[2] << "\n";
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
