#include <bits/stdc++.h>
using namespace std;
namespace IO {
const int MAXIOSIZE = 1 << 24 | 1;
unsigned char buf[MAXIOSIZE], *p1, *p2;
template <typename T>
void read(T& x) {
  x = 0;
  char ch =
      (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 24, stdin), p1 == p2)
           ? EOF
           : *p1++);
  bool flg = false;
  for (; ch < '0' || '9' < ch;
       ch = (p1 == p2 &&
                     (p2 = (p1 = buf) + fread(buf, 1, 1 << 24, stdin), p1 == p2)
                 ? EOF
                 : *p1++))
    if (ch == '-') flg |= true;
  for (; '0' <= ch && ch <= '9';
       ch = (p1 == p2 &&
                     (p2 = (p1 = buf) + fread(buf, 1, 1 << 24, stdin), p1 == p2)
                 ? EOF
                 : *p1++))
    x = x * 10 + ch - '0';
  flg ? x = -x : 0;
}
template <typename T>
void out(const T& x) {
  if (x > 9) out(x / 10);
  putchar(x % 10 + '0');
}
template <typename T>
inline void write(const T& x, const char& ed = ' ') {
  if (x < 0)
    putchar('-'), out(-x);
  else
    out(x);
  putchar(ed);
}
}  // namespace IO
const int MAXN = 2e5 + 10;
int n, arr[MAXN];
bool chk(int x, bool out) {
  int lst = -INT_MAX, idx = 1, cnt = 0;
  for (int i = (1), iend = (3); i <= iend; ++i) {
    while (idx <= n && arr[idx] <= lst + x) ++idx;
    if (idx > n) break;
    ++cnt;
    if (out) printf("%.8f ", 0.5 * x + arr[idx]);
    lst = arr[idx];
  }
  if (lst + x < arr[n]) return false;
  if (out)
    for (int i = (cnt + 1), iend = (3); i <= iend; ++i) printf("0 ");
  return true;
}
int main() {
  IO::read(n);
  for (int i = (1), iend = (n); i <= iend; ++i) IO::read(arr[i]);
  sort(arr + 1, arr + n + 1);
  int l = -1, r = arr[n] - arr[1];
  while (r > l + 1) {
    int mid = (l + r) >> 1;
    if (chk(mid, false))
      r = mid;
    else
      l = mid;
  }
  printf("%.8f\n", (0.5) * r);
  chk(r, true);
  return 0;
}
