#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<long long> a(n);
	rep(i, n)cin >> a[i];
	sort(all(a));

	auto median2 = [&](int l, int r) -> long long {
		int n = r - l;
		if (n % 2 == 1) return 2 * a[l + n / 2];
		else return a[l + n / 2 - 1] + a[l + n / 2];
	};

	long long q1_2 = median2(0, n / 2);
	long long q2_2 = median2(0, n);
	long long q3_2 = median2(n - n / 2, n);

	long long lower4 = 5 * q1_2 - 3 * q3_2;
	long long upper4 = 5 * q3_2 - 3 * q1_2;

	int u = 0;
	for (long long x : a) {
		if (4 * x < lower4 || 4 * x > upper4) ++u;
	}

	auto print_half = [](long long x) {
		if (x % 2 == 0) cout << x / 2;
		else cout << x / 2 << ".5";
	};

	print_half(q1_2);
	cout << " ";
	print_half(q2_2);
	cout << " ";
	print_half(q3_2);
	cout << " " << u << endl;
	return 0;
}