#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
double A[N];
int n;
bool target(double t) {
  int i = 0;
  i = upper_bound(A, A + n, A[0] + 2 * t) - A;
  if (i == n) return 1;
  i = upper_bound(A + i - 1, A + n, A[i] + 2 * t) - A;
  if (i == n) return 1;
  i = upper_bound(A + i - 1, A + n, A[i] + 2 * t) - A;
  if (i == n)
    return 1;
  else
    return 0;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> A[i];
  sort(A, A + n);
  double l = 0, r = 1e9, mid, ans;
  while (r - l > 0.0000005) {
    mid = (l + r) / 2;
    if (target(mid)) {
      ans = mid;
      r = mid;
    } else {
      l = mid;
    }
  }
  cout << fixed << setprecision(6) << ans << endl;
  cout << fixed << setprecision(6) << A[0] + ans << " ";
  auto i = upper_bound(A, A + n, A[0] + 2 * ans);
  cout << fixed << setprecision(6) << *i + ans << " ";
  i = upper_bound(i, A + n, *i + 2 * ans);
  cout << fixed << setprecision(6) << *i + ans;
  return 0;
}
