#include <bits/stdc++.h>
using namespace std;
bool solve(long long x);
double l = 0, h = 10000000000, mid, mid1 = 0.0, pos1, pos2, pos3;
long long arr[1000000];
int n;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  for (int i = 0; i < 1000; i++) {
    mid = (h + l) / 2;
    if (solve(mid)) {
      h = mid;
    } else {
      l = mid;
    }
  }
  if (n == 3) {
    mid = 0.0;
  }
  mid /= 2.0;
  printf("%.6f\n", mid);
  pos1 = arr[0] + mid;
  pos2 = *upper_bound(arr, arr + n, pos1 + mid) + mid;
  if (*upper_bound(arr, arr + n, pos2 + mid)) {
    pos3 = *upper_bound(arr, arr + n, pos2 + mid) + mid;
  } else {
    pos3 = arr[n - 1] + mid;
  }
  printf("%.6f", pos1);
  cout << " ";
  printf("%.6f", pos2);
  cout << " ";
  printf("%.6f", pos3);
  return 0;
}
bool solve(long long x) {
  double d = arr[0] + x;
  int test = *upper_bound(arr, arr + n, d);
  if (!test) {
    return 1;
  }
  d = test + x;
  test = *upper_bound(arr, arr + n, d);
  if (!test) {
    return 1;
  }
  d = test + x;
  test = *upper_bound(arr, arr + n, d);
  if (!test) {
    return 1;
  }
  return 0;
}
