#include <bits/stdc++.h>
using namespace std;
const int maxn = 210000;
const int inf = 1000000100;
int point[maxn];
int maxl;
int n;
int minl;
int find(int pos) {
  int l = 0;
  int r = n - 1;
  int mid;
  int ok = -1;
  while (l <= r) {
    mid = (l + r) / 2;
    if (point[mid] <= pos) {
      ok = mid;
      l = mid + 1;
    } else
      r = mid - 1;
  }
  return ok;
}
int q2, q3;
bool check(int mid) {
  q2 = 0;
  q3 = 0;
  int z = minl + mid;
  int k = find(z);
  if (k == n - 1) return 1;
  q2 = k + 1;
  z = point[k + 1] + mid;
  k = find(z);
  if (k == n - 1) return 1;
  q3 = k + 1;
  z = point[k + 1] + mid;
  if (z >= maxl) return 1;
  return 0;
}
int solve() {
  int l = 0, r = maxl;
  int mid;
  int ok;
  while (l <= r) {
    mid = (l + r) / 2;
    if (check(mid)) {
      ok = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  return ok;
}
int main(int argc, char** argv) {
  scanf("%d", &n);
  maxl = 0;
  minl = inf;
  for (int i = 0; i < n; i++) {
    scanf("%d", &point[i]);
    if (point[i] > maxl) maxl = point[i];
    if (point[i] < minl) minl = point[i];
  }
  sort(point, point + n);
  int d = solve();
  check(d);
  double r = d / 2.0;
  printf("%6lf\n", r);
  printf("%.6lf %.6lf %.6lf\n", point[0] + r, point[q2] + r, point[q3] + r);
  return 0;
}
