#include <bits/stdc++.h>
using namespace std;
const int N1 = 205000;
long long point[N1];
double station[4];
bool seekOk(int m, long long d) {
  double r = double(d) / 2;
  int ith = 1;
  long long maxn = point[1] + d;
  station[1] = point[ith] + r;
  while (ith < m && point[ith] <= maxn) ith++;
  maxn = point[ith] + d;
  station[2] = point[ith] + r;
  while (ith < m && point[ith] <= maxn) ith++;
  maxn = point[ith] + d;
  station[3] = point[ith] + r;
  if (point[m] <= maxn)
    return true;
  else
    return false;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &point[i]);
  }
  sort(point + 1, point + 1 + n);
  int m = unique(point + 1, point + 1 + n) - 1 - point;
  long long lt = 0, rt = (point[m] - point[1]);
  while (rt > lt) {
    if (seekOk(m, ((lt + rt) >> 1)))
      rt = ((lt + rt) >> 1);
    else
      lt = ((lt + rt) >> 1) + 1;
  }
  if (!seekOk(m, lt)) seekOk(m, lt + 1);
  if (lt)
    printf("%.6f\n", double(lt) / 2);
  else
    printf("0\n");
  printf("%.6f %.6f %.6f\n", station[1], station[2], station[3]);
  return 0;
}
