#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

ll med(vector<ll> a) {
    int n = a.size();
    // for (ll i : a)
    //     cout << i << " ";
    // cout << endl;
    if (n % 2) {
        return a[n / 2];
    } else {
        return ((a[n / 2 - 1] + a[n / 2]) / 2);
    }
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) {
        cin >> a[i];
        a[i] *= 4;
    }
    sort(a.begin(), a.end());
    ll q1, q2, q3;
    q2 = med(a);
    q1 = med(vector<ll>(a.begin(), a.begin() + n / 2));
    q3 = med(vector<ll>(a.end() - n / 2, a.end()));
    ll IQR = q3 - q1;
    int u = 0;
    rep(i, n) {
        if (a[i] < q1 - IQR * 3 / 2 || a[i] > q3 + IQR * 3 / 2)
            u++;
    }
    cout << fixed << setprecision(12);
    cout << double(q1) / 4 << " ";
    cout << double(q2) / 4 << " ";
    cout << double(q3) / 4 << " ";
    cout << u << endl;
    return 0;
}