#include <bits/stdc++.h>
using namespace std;
int a[200001];
int main() {
  int n;
  while (scanf("%d", &n) >= 1) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    sort(a, a + n);
    double bp0 = a[0], bp1 = a[0], bp2 = a[0];
    int d = a[n - 1] - a[0];
    for (int i = 1; i < n; i++) {
      int l = i;
      int r = n - 1;
      while (r > l + 1) {
        int mid = (l + r) / 2;
        if ((a[mid] - a[i]) - (a[n - 1] - a[mid + 1]) > 0)
          r = mid;
        else
          l = mid;
      }
      int dn = max(a[i - 1] - a[0],
                   max(a[l] - a[i], a[n - 1] - a[min(l + 1, n - 1)]));
      if (d > dn) {
        d = dn;
        bp0 = (a[i - 1] + a[0] + 0.0) / 2;
        bp1 = (a[l] + a[i] + 0.0) / 2;
        bp2 = (a[n - 1] + a[min(l + 1, n - 1)] + 0.0) / 2;
      }
      l = i;
      r = n - 1;
      while (r > l + 1) {
        int mid = (l + r) / 2;
        if ((a[mid] - a[i]) - (a[n - 1] - a[mid + 1]) < 0)
          l = mid;
        else
          r = mid;
      }
      dn = max(a[i - 1] - a[0],
               max(a[r] - a[i], a[n - 1] - a[min(r + 1, n - 1)]));
      if (d > dn) {
        d = dn;
        bp0 = (a[i - 1] + a[0] + 0.0) / 2;
        bp1 = (a[r] + a[i] + 0.0) / 2;
        bp2 = (a[n - 1] + a[min(r + 1, n - 1)] + 0.0) / 2;
      }
    }
    if (n == 2) {
      bp2 = a[1];
      d = 0;
    }
    printf("%.6lf\n%.6lf %.6lf %.6lf\n", (d + 0.0) / 2, bp0, bp1, bp2);
  }
  return 0;
}
