#include <bits/stdc++.h>
using namespace std;
bool calc(const vector<double> &h, double d) {
  vector<double>::const_iterator it;
  it = upper_bound((h).begin(), (h).end(), h[0] + 2 * d);
  if (it == h.end()) return false;
  it = upper_bound((h).begin(), (h).end(), *it + 2 * d);
  if (it == h.end()) return false;
  it = upper_bound((h).begin(), (h).end(), *it + 2 * d);
  if (it == h.end()) return false;
  return true;
}
int main(void) {
  int n;
  double mn, mx;
  scanf("%d", &n);
  vector<double> h(n);
  for (int i = (0); i < ((n)); ++i) scanf("%lf", &h[i]);
  sort((h).begin(), (h).end());
  mn = 0;
  mx = h[n - 1];
  double md;
  for (int i = (0); i < ((100)); ++i) {
    md = (mx + mn) / 2;
    if (!calc(h, md))
      mx = md;
    else
      mn = md;
  }
  md = floor((md + 0.000001) * 2.0) / 2.0;
  printf("%.6f\n", md);
  printf("%.6f ", h[0] + md);
  vector<double>::iterator it =
      upper_bound((h).begin(), (h).end(), h[0] + 2 * md);
  if (it == h.end()) it = h.begin() + (n - 1);
  printf("%.6f ", *it + md);
  it = upper_bound((h).begin(), (h).end(), *it + 2 * md);
  if (it == h.end()) it = h.begin() + (n - 1);
  printf("%.6f", *it + md);
}
