#include <bits/stdc++.h>
using namespace std;
const int maxN = 200 * 1000 + 5;
const int mod = 1000 * 1000 * 1000 + 7;
double a[maxN];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  double lo = 0, hi = 1e9 + 100;
  for (int t = 0; t < 500; t++) {
    double mid = (lo + hi) / 2;
    double val1 = a[0] + 2 * mid + 1e-9;
    int pos1 = upper_bound(a, a + n, val1) - a;
    double val2 = a[pos1] + 2 * mid + 1e-9;
    int pos2 = upper_bound(a, a + n, val2) - a;
    double val3 = a[pos2] + 2 * mid + 1e-9;
    int pos3 = upper_bound(a, a + n, val3) - a;
    if (pos3 == n || pos2 == n || pos1 == n)
      hi = mid;
    else
      lo = mid;
  }
  cout << fixed << setprecision(8);
  cout << lo << endl;
  double val1 = a[0] + 2 * lo + 1e-6;
  cout << a[0] + lo << ' ';
  int pos1 = upper_bound(a, a + n, val1) - a;
  double val2 = a[pos1] + 2 * lo + 1e-6;
  cout << a[pos1] + lo << ' ';
  int pos2 = upper_bound(a, a + n, val2) - a;
  cout << a[pos2] + lo << endl;
  return 0;
}
