#include <bits/stdc++.h>
using namespace std;
int n, arr[200010];
double sol[3], tmp[3];
bool v(double d) {
  double end = 0;
  int j = 0;
  for (int i = 0; i < n; i++) {
    if (arr[i] > end) {
      if (j == 3) return 0;
      tmp[j++] = d + arr[i];
      end = arr[i] + 2.0 * d;
    }
  }
  for (int i = 0; i < 3; i++) sol[i] = tmp[i];
  return 1;
}
double S() {
  double l = 0, r = arr[n - 1];
  for (int i = 0; i < 400; i++) {
    double mid = (l + r) / 2;
    if (v(mid))
      r = mid;
    else
      l = mid;
  }
  return l;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  printf("%.6lf\n", S());
  printf("%.6lf %.6lf %.6lf", sol[0], sol[1], sol[2]);
  return 0;
}
