#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
const int M = 2 * 100000 + 2;
int dis[M];
int n;
void work() {
  sort(dis, dis + n);
  int i;
  double le = 0, ri = dis[n - 1] - dis[0];
  int ans[3];
  while (le + eps < ri) {
    double mid = (le + ri) * 0.5;
    for (i = 0; i < n; i++)
      if (dis[i] - dis[0] > mid * 2.0) {
        ans[0] = i - 1;
        break;
      }
    if (i == n) {
      ri = mid;
      continue;
    }
    int j = i;
    for (i = i + 1; i < n; i++)
      if (dis[i] - dis[j] > mid * 2.0) {
        ans[1] = i - 1;
        break;
      }
    if (i == n) {
      ri = mid;
      continue;
    }
    if (dis[n - 1] - dis[i] > mid * 2.0)
      le = mid;
    else
      ri = mid;
  }
  le = ri;
  for (i = 0; i < n; i++)
    if (dis[i] - dis[0] > le * 2.0) {
      break;
    }
  double tmp;
  if (i == n) i--;
  tmp = dis[i] + le;
  if (tmp > dis[n - 1] - le) tmp = dis[n - 1] - le;
  printf("%lf\n", le);
  printf("%lf %lf %lf\n", dis[0] + le, tmp, dis[n - 1] - le);
}
void init() {
  for (int i = 0; i < n; i++) scanf("%d", &dis[i]);
}
int main() {
  scanf("%d", &n);
  init();
  work();
  return 0;
}
