#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<functional>
using namespace std;
#define rep(i, n) for (int i=0; i<(int) (n);i++)
using ll = long long;
using P = pair<int, int>;

void solve_1() {//14m
	int a, b;
	cin >> a >> b;
	int total;
	int n = 0;
	while (!((a-1)*n + 1 >= b)) {
		n++;
	}
	cout << n << endl;

}

void solve_2() {//30m
	int n;
	cin >> n;
	vector<int> x;
	int total = 0;
	rep(i, n) {
		int tmp;
		cin >> tmp;
		x.push_back(tmp);
		total += tmp;
	}
	int p1 = (double(total)/double(n)*2 - 1.0) / 2;
	int p2 = (double(total)/double(n)*2 - 1.0) / 2 + 1;
	int point_sum1 = 0, point_sum2= 0;
	rep(i, n) {
		point_sum1 += pow(x[i] - p1, 2);
		point_sum2 += pow(x[i] - p2, 2);
	}
	cout << min(point_sum1, point_sum2) << endl;

}

void solve_2re() {
	int n;
	cin >> n;
	vector<int> x(n);
	int total = 0;
	rep(i, n) {
		cin >> x[i];
		total += x[i];
	}
	int p1 = total / n;
	int p2 = total / n + 1;
	int point_sum1 = 0, point_sum2 = 0;
	rep(i, n) {
		point_sum1 += pow(x[i] - p1, 2);
		point_sum2 += pow(x[i] - p2, 2);
	}
	cout << min(point_sum1, point_sum2) << endl;
}

void solve_3() {//17m
	int n, a, b;
	cin >> n >> a >> b;
	string s;
	cin >> s;
	int sum = a + b;
	rep(i, n) {
		if (s[i] == 'a') {
			cout << (sum > 0 ? "Yes" : "No") << endl;
			if (sum>0) {
				sum--;
			}
		}
		else if (s[i] == 'b') {
			cout << (sum > 0 && b > 0 ? "Yes" : "No") << endl;
			if (sum > 0 && b > 0) {
				if (b>0) {
					sum--;
					b--;
				}
				else {
					sum--;
				}
			}
		}
		else if (s[i] == 'c') {
			cout << "No" << endl;
		}
	}
}

void solve_4() {//7m
	int n;
	cin >> n;
	rep(i, 50000) {
		if (int(i*1.08) == n) {
			cout << i;
			return;
		}
	}
	cout << ":(";
}

void solve_4re() {
	int n;
	cin >> n;
	int x = ceil(n/ 1.08);
	if (int(x*1.08)==n) {
		cout << x;
	}
	else
	{
		cout << ":(";
	}
}

void solve_5() {//7m
	int n, m, c;
	cin >> n >> m >> c;
	vector<int> b(m);
	int score;
	int count = 0;
	rep(i, m) cin >> b[i];
	rep(i, n) {
		score = c;
		rep(i, m) {
			int a;
			cin >> a;
			score += b[i] * a;
		}
		if (score>0) {
			count++;
		}
	}
	cout << count;
}

void solve_6() {//16m
	ll h, w;
	cin >> h >> w;
	if (h==1||w==1) {
		cout << 1;
		return;
	}
	cout << (h*w+1)/2;
}

void solve_7() {
	const int m = 3;
	vector<vector<int> > a;
	rep(i, m) {
		vector<int> tmp_v = {};
		rep(i, m) {
			int tmp;
			cin >> tmp;
			tmp_v.push_back(tmp);
		}
		a.push_back(tmp_v);
	}
	int n;
	cin >> n;
	bool appear[m][m];
	rep(i, m) {
		rep(j, m) {
			appear[i][j] = false;
		}
	}
	rep(i, n) {
		int b;
		cin >> b;
		rep(i, m) {
			rep(j, m) {
				if (a[i][j] == b) {
					appear[i][j] = true;
				}
			}
		}
	}
	string ans = "No";
	rep(i, m) {
		if (appear[i][0] && appear[i][1] && appear[i][2]) {
			ans = "Yes";
		}
		if (appear[0][i] && appear[1][i] && appear[2][i]) {
			ans = "Yes";
		}
	}
	if (appear[0][0] && appear[1][1] && appear[2][2]) {
		ans = "Yes";
	}
	if (appear[0][2] && appear[1][1] && appear[2][0]) {
		ans = "Yes";
	}
	cout << ans;

}

#define INF 1e+10
void solve_12() {
	int k, n;
	cin >> k >> n;
	vector<int> a(n+2);
	rep(i, n) {
		cin >> a[i + 1];
	}
	//境界条件の設定
	a[0] = a[n];
	a[n + 1] = a[1]+ k;
	//A0 == 0の時、境界条件を訂正する
	//if (a[1] == 0) a[n+1] = a[1] + k;

	int min_distance = INF;
	rep(i, n) {
		//min_distance = min(min(k - abs((a[i+1] - a[i])),k - abs((a[i + 2] - a[i+1]))), min_distance);
		min_distance = min(abs(k - a[i + 2] + a[i+1]), min_distance);
	}

	cout << min_distance;

}

void solve_15() {//10m
	int n;
	cin >> n;
	vector<int> d(n);
	rep(i, n) cin >> d[i];
	sort(d.begin(), d.end());
	int half_n = n / 2 - 1;
	cout << d[half_n+1] - d[half_n] << endl;
}

void solve_16() {//8m
	int n;
	cin >> n;
	vector<int> a(n);
	vector<int> ans(n);
	rep(i, n) cin >> a[i];
	rep(i, n) ans[a[i] -1] = i+1;
	rep(i, n) {
		cout << ans[i] << " ";
	}
	cout << endl;
}

void solve_17() {
	int n;
	cin >> n;
	priority_queue<double, vector<double>, greater<double> > que;
	rep(i, n) {
		double tmp;
		cin >> tmp;
		que.push(tmp);
	}
	while (que.size() > 1) {
		double x = que.top();
		que.pop();
		double y = que.top();
		que.pop();
		que.push((x + y) / 2.0);
	}
	double ans = que.top();
	que.pop();
	cout << ans << endl;
}

void solve_18() {

}

void solve_19() {

}


void solve_100() {//20m
	int n;
	cin >> n;
	vector<int> a(n);
	int pair_count = 0;
	rep(i, n) {
		cin >> a[i];
	}
	rep(i, n) {
		if (a[a[i]-1] -1 == i) {
			pair_count++;
		}
	}
	cout << pair_count/2;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	solve_17();

	return 0;
}

Measured memory_bytes: 256