#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
bool fun(double x) {
  long long req = 1;
  double l = v[0];
  for (long long i = 0; i < v.size(); i++) {
    if (v[i] - l <= 2 * x) {
    } else {
      req++;
      l = v[i];
    }
  }
  return req <= 3 ? true : false;
}
void solve() {
  long long n, x;
  cin >> n;
  set<long long> second;
  for (long long i = 0; i < n; i++) {
    cin >> x;
    second.insert(x);
  }
  for (auto &x : second) v.push_back(x);
  if (v.size() <= 3) {
    cout << 0 << "\n";
    for (long long x : v) cout << x << " ";
    for (long long i = 0; i < 3 - v.size(); i++) cout << v.back() << " ";
    return;
  }
  double hi = v.back();
  double lo = 0.0;
  long long cnt = 100;
  while (cnt--) {
    double mid = (hi + lo) / 2;
    bool val = fun(mid);
    if (val) {
      hi = mid;
    } else {
      lo = mid;
    }
  }
  double ans[3];
  ans[0] = v[0] + lo;
  ans[2] = v.back() - lo;
  double yy = v[0] + 2 * lo;
  auto it = upper_bound(v.begin(), v.end(), (long long)(0.05 + v[0] + 2 * lo));
  ans[1] = v[it - v.begin()] + lo;
  cout << lo << "\n";
  cout << ans[0] << " " << ans[1] << " " << ans[2] << "\n";
  return;
}
int main() {
  std::cout << std::fixed;
  std::cout << std::setprecision(15);
  ;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  t = 1;
  while (t--) solve();
  return 0;
}
