#include <bits/stdc++.h>
using namespace std;
int n;
int a[100010];
long long cur;
bool cmp(int x, int y) {
	return x > y;
}
int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res *= a;
		a *= a;
		b >>= 1;
	}
	return res;
}

int main() {
	// freopen("p3.in", "r", stdin);
	// freopen("p3.out", "w", stdout);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1, cmp);
	for (int i = 1; i <= n; i++) {
		// cout << a[i] << " " << i << " " << (int)pow(a[i], 1.0 / i) << endl;
		// cout << i << " " << qpow(2, i - 1) << endl;
		cur += (int)pow(a[i], 1.0 / qpow(2, i - 1));
	}
	cout << cur;
	return 0;
}