#include <iostream>
#include <ranges>
#include <algorithm>
#include <vector>
using namespace std;
using ll=long long;

#include <atcoder/all>
using mint=atcoder::modint998244353;

ostream& operator<<(ostream& os,mint& x){
	os<<x.val();
	return os;
}
istream& operator>>(istream& is,mint& x){
	int t;
	is>>t;
	x=t;
	return is;
}

template <typename S,typename T>
ostream& operator<<(ostream& os,const pair<S,T>& p);
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p);
template <typename T,size_t n>
ostream& operator<<(ostream& os,const array<T,n>& arr);
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr);
template <typename T>
ostream& operator<<(ostream& os,const vector<T>& vec);
template <typename T>
istream& operator>>(istream& is,vector<T>& vec);

template <typename S,typename T>
ostream& operator<<(ostream& os,pair<S,T>& p){
	os<<p.first<<" "<<p.second;
	return os;
}
template <typename S,typename T>
istream& operator>>(istream& is,pair<S,T>& p){
	is>>p.first>>p.second;
	return is;
}

template <typename T,size_t n>
ostream& operator<<(ostream& os,array<T,n>& arr){
	for(int i=0;i<n;i++)os<<arr[i]<<(i+1==n?"":" ");
	return os;
}
template <typename T,size_t n>
istream& operator>>(istream& is,array<T,n>& arr){
	for(int i=0;i<n;i++)is>>arr[i];
	return is;
}
template <typename T>
ostream& operator<<(ostream& os,vector<T>& vec){
	for(int i=0;i<vec.size();i++)os<<vec[i]<<(i+1==vec.size()?"":" ");
	return os;
}
template <typename T>
istream& operator>>(istream& is,vector<T>& vec){
	for(int i=0;i<vec.size();i++)is>>vec[i];
	return is;
}

template <typename T>
vector<T> make_unique(vector<T> vec){
	ranges::sort(vec);
	vec.erase(unique(vec.begin(),vec.end()),vec.end());
	return vec;
}

template <typename T>
vector<int> make_rank(vector<T> vec){
	int n=vec.size();
	vector<int> res(n);
	iota(res.begin(),res.end(),0);
	ranges::sort(vec,{},[&](int i)->T{
		return vec[i];
	});
	return res;
}


int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n;
	cin>>n;
	vector<double> a(n);
	cin>>a;
	ranges::sort(a);
	//cout<<a<<endl;
	vector<double> q(3);
	if(n%2==0)q[1]=(a[n/2-1]+a[n/2])/2.0;
	else q[1]=a[n/2];
	//cout<<q[1]<<endl;
	vector<vector<double>> b(3);
	for(int i=0;i<n/2;i++){
		b[0].push_back(a[i]);
		b[2].push_back(a[n-i-1]);
	}
	for(int j=0;j<3;j+=2){
		ranges::sort(b[j]);
		int m=n/2;
		if(m%2==0)q[j]=(b[j][m/2-1]+b[j][m/2])/2.0;
		else q[j]=b[j][m/2];
	}
	double iqr=q[2]-q[0];
	int ans=0;

	for(int i=0;i<n;i++){
		if(a[i]<q[0]-1.5*iqr||a[i]>q[2]+1.5*iqr)ans++;
	}
	cout<<q[0]<<" "<<q[1]<<" "<<q[2]<<" "<<ans<<endl;
}