#include <bits/stdc++.h>
using namespace std;
vector<int> a(200000);
bool check(double c1, double n1) {
  int j = 0, f = 0, t = 0;
  while (j < n1 && f <= 3) {
    f++;
    double x = a[j] + c1 * 2;
    while (a[j] <= x && j < n1) {
      j++;
    }
    if (j == n1) t = 1;
  }
  return t == 1 && f <= 3;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int i;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n <= 3) {
    cout << "0" << endl;
    if (n == 1) cout << a[0] << ' ' << a[0] << ' ' << a[0];
    if (n == 2) cout << a[0] << ' ' << a[1] << ' ' << a[1];
    if (n == 3) cout << a[0] << ' ' << a[1] << ' ' << a[2];
    return 0;
  }
  sort(&a[0], &a[n]);
  double l = 0, r = a[n - 1], ans = 0;
  while (r - l > 1e-7) {
    double c = (r + l) / 2;
    if (check(c, n)) {
      r = c;
      ans = c;
    } else
      l = c;
  }
  cout.precision(7);
  cout << fixed;
  cout << ans << endl;
  i = 0;
  int fl = 0;
  while (i < n) {
    fl++;
    cout << a[i] + ans << ' ';
    double l = a[i] + ans * 2;
    while (a[i] <= l && i < n) i++;
  }
  if (fl < 3) {
    for (i = fl; i < 3; i++) cout << a[n - 1] << ' ';
  }
  return 0;
}
