#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
#ifdef Doludu
template <typename T>
ostream& operator << (ostream &o, vector <T> vec) {
    o << "{"; int f = 0;
    for (T i : vec) o << (f++ ? " " : "") << i;
    return o << "}";
}
void bug__(int c, auto ...a) {
    cerr << "\e[1;" << c << "m";
    (..., (cerr << a << " "));
    cerr << "\e[0m" << endl;
}
#define bug_(c, x...) bug__(c, __LINE__, "[" + string(#x) + "]", x)
#define bug(x...) bug_(32, x)
#define bugv(x...) bug_(36, vector(x))
#define safe bug_(33, "safe")
#else
#define bug(x...) void(0)
#define bugv(x...) void(0)
#define safe void(0)
#endif
const int mod = 998244353, N = 100005;

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    vector <int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    sort(all(a));
    auto solve = [&](int l, int r) {
        if ((r - l) & 1) {
            int m = l + r >> 1;
            return a[m] + a[m + 1];
        } else {
            return a[l + r >> 1] * 2;
        }
    };
    auto out = [&](int x) {
        cout << x / 2 << "." << (x % 2) * 5 << " ";
    };
    ll x = solve(0, n / 2 - 1), y = solve(0, n - 1), z = solve(n - n / 2, n - 1);
    out(x), out(y), out(z);
    ll gap = z - x;
    ll l = x * 2 - gap * 3, r = z * 2 + gap * 3;
    bug(l, r);
    int cnt = 0;
    for (int i = 0; i < n; ++i) {
        if (4ll * a[i] < l || 4ll * a[i] > r) cnt++;
    }
    cout << cnt << "\n";
}