#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
map<int, bool> vis;
vector<int> raw;
int ans[114514], M, s;
inline int idxLB(int x) {
  return lower_bound(raw.begin(), raw.end(), x) - raw.begin();
}
inline int idxUB(int x) {
  return upper_bound(raw.begin(), raw.end(), x) - raw.begin();
}
bool judge(int d) {
  int idx = 0;
  for (int i = 1; i <= 3; i++) {
    idx = idxUB(raw[idx] + d);
    ans[i] = idx;
    if (idx == s) return 1;
  }
  return 0;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int tmp;
    scanf("%d", &tmp);
    if (!vis[tmp]) {
      vis[tmp] = 1;
      raw.push_back(tmp);
    }
  }
  sort(raw.begin(), raw.end());
  s = raw.size();
  int L = 0, R = INF;
  while (L <= R) {
    M = L + (R - L) / 2;
    if (judge(M))
      R = M - 1;
    else
      L = M + 1;
  }
  if (judge(M) ? 0 : M++) judge(M);
  printf("%.6lf\n", M / 2.0);
  for (int i = 0; i <= 2; i++)
    printf("%.6lf ", raw[ans[i] >= s ? 0 : ans[i]] + (M / 2.0));
  return 0;
}
