#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned ll
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<ll>
#define vvel vector<vel>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define vvepll vector<vepll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define pmm pair<mint,mint>
#define cleout(i) cout<<fixed<<setprecision(i)
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> di={-1, 0, 1, 0};
vector<int> dj={ 0, 1, 0,-1};

vector<int> dx={ 0, 1, 0,-1};
vector<int> dy={ 1, 0,-1, 0};


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll inf=1000000000000000000;//1e18
// LLONG_MAX

mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count());

void _solve(){
    ll N;
    cin>>N;
    vel a(N);
    rep(i,0,N)cin>>a[i];
    ll Q1,Q2,Q3;
    sort(a.begin(),a.end());
    auto f=[](vel v){
        if(v.size()%2)return 2*v[v.size()/2];
        return v[v.size()/2]+v[v.size()/2-1];
    };
    Q2=f(a);
    {
        vel w;
        rep(i,0,N/2)w.push_back(a[i]);
        Q1=f(w);
    }
    reverse(a.begin(),a.end());
    {
        vel w;
        rep(i,0,N/2)w.push_back(a[i]);
        Q3=f(w);
    }
    ll cnt=0;
    for(ll x:a){
        if(4*x<5*Q1-3*Q3||4*x>5*Q3-3*Q1)cnt++;
    }
    cout<<Q1/(ld)2<<" "<<Q2/(ld)2<<" "<<Q3/(ld)2<<" "<<cnt<<"\n";
}


int main(){
    cin.tie(nullptr);
 	ios_base::sync_with_stdio(false);

    
    ll _;
    bool multitest=0;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}