#include <bits/stdc++.h>
using namespace std;
struct iii {
  int a, b, c;
  iii() {}
  iii(int a, int b, int c) : a(a), b(b), c(c) {}
  bool operator<(const iii& e) const {
    return a < e.a || a == e.a && (b < e.b || b == e.b && c < e.c);
  }
};
template <typename T>
T sq(const T& x) {
  return x * x;
}
template <typename T>
void minl(T& a, const T& b) {
  if (a > b) a = b;
}
template <typename T>
void maxl(T& a, const T& b) {
  if (a < b) a = b;
}
template <typename T>
void usort(vector<T>& a) {
  sort((a).begin(), (a).end());
  a.erase(unique((a).begin(), (a).end()), a.end());
}
template <typename T>
int index(const vector<T>& a, const T& x) {
  return lower_bound((a).begin(), (a).end(), x) - a.begin();
}
pair<int, int> operator+(const pair<int, int>& a, const pair<int, int>& b) {
  return pair<int, int>(a.first + b.first, a.second + b.second);
}
pair<int, int> operator-(const pair<int, int>& a, const pair<int, int>& b) {
  return pair<int, int>(a.first - b.first, a.second - b.second);
}
long long cross(const pair<int, int>& a, const pair<int, int>& b) {
  return (long long)a.first * b.second - (long long)b.first * a.second;
}
int n;
double a[200000];
double pos[3];
bool check(double d) {
  int j = 0;
  double p = a[0] + d + d;
  for (int i = 0; i < 3; i++) {
    pos[i] = p - d;
    for (;; j++) {
      if (j >= n) return true;
      if (a[j] > p) break;
    }
    p = a[j] + d + d;
  }
  return false;
}
void york() {
  double lf = 0.0, rt = 1e9;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lf", a + i);
  sort(a, a + n);
  int rep = 85;
  while (rep--) {
    double mid = (lf + rt) / 2;
    if (check(mid))
      rt = mid;
    else
      lf = mid;
  }
  printf("%.6f\n", rt);
  printf("%.6f %.6f %.6f\n", pos[0], pos[1], pos[2]);
}
int main() {
  york();
  return 0;
}
