#include <bits/stdc++.h>
using namespace std;
template <typename T>
int size(const T& c) {
  return int(c.size());
}
template <typename T>
T abs(T x) {
  return x < 0 ? -x : x;
}
template <typename T>
T sqr(T x) {
  return x * x;
}
template <typename T>
bool remin(T& x, T y) {
  if (x <= y) return false;
  x = y;
  return true;
}
template <typename T>
bool remax(T& x, T y) {
  if (x >= y) return false;
  x = y;
  return true;
}
int n;
vector<long long> x;
bool tryPut(long long d, long long& x1, long long& x2, long long& x3) {
  int i = 0, c = 0;
  while (i < n && c < 3) {
    ++c;
    if (c == 1)
      x1 = x[i];
    else if (c == 2)
      x2 = x[i];
    else
      x3 = x[i];
    long long from = x[i];
    while (i < n && x[i] <= from + d) ++i;
  }
  if (i < n) return false;
  if (c == 1) {
    x2 = x3 = x1;
  } else if (c == 2) {
    x3 = x2;
  }
  return true;
}
int main() {
  scanf("%d", &n);
  x.resize(n);
  for (int i(0), _n(n); i < _n; ++i) scanf("%lld", &x[i]);
  sort(x.begin(), x.end());
  long long ans, x1, x2, x3;
  if (tryPut(0, x1, x2, x3))
    ans = 0;
  else {
    int L = 0, R = 1;
    while (!tryPut(R, x1, x2, x3)) {
      L = R;
      R *= 2;
    }
    while (R - L > 1) {
      int M = (L + R) / 2;
      if (tryPut(M, x1, x2, x3))
        R = M;
      else
        L = M;
    }
    tryPut(R, x1, x2, x3);
    ans = R;
  }
  printf("%.6lf\n%.6lf %.6lf %.6lf\n", 0.5 * ans, x1 + 0.5 * ans,
         x2 + 0.5 * ans, x3 + 0.5 * ans);
}
