#include<bits/stdc++.h>
#define int long long
using namespace std;
long long n, a[305], sum[305], f[305][305], err[305];
const long long inf = 2147483648;
bool cmp(int p, int q) {
	return p > q;
}
inline int calc(int p, int q) {
	int op = p / q, cnt = 0;
	cnt = err[op] * (q - p % q);
	cnt += err[op + 1] * (p % q);
	if (cnt >= inf) return inf;
//	cout << p << " " << q << ' ' << cnt << "[]\n";
	return cnt;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1, cmp);
	for (int i = n; i >= 1; i--) {
		sum[i] = sum[i + 1] + a[i];
	}
	err[0] = 1;
	for (int i = 1; i <= n; i++) {
		err[i] = err[i - 1] * 2;
		if (err[i] > inf) err[i] = inf + 1;
	}
	for (int i = 0; i <= n; i++) err[i]--;
	f[1][1] = sum[2];
	int p, q;
	for (int i = 2; i <= n; i++) {
		for (int j = i ; j >= 2; j--) {
			p = i - j + 1;
			f[i][p] = inf;
			for (int k = j - 1; k >= 1; k--) {
				if (k == 1 && j != 2) break;
				q = j - 1 - k + 1;
				f[i][p] = min(f[i][p], f[j - 1][q] + calc(p, q) + sum[i + 1]);
			}
//			cout << i << ' ' << p << "^" << f[i][p] << "\n";
		}
	}
	int ans = inf;
	for (int i = 1; i < n; i++) {
		ans = min(ans, f[n][i]);
	}
	if (ans > 2147483647) {
		cout << "Too expensive!";
		return 0;
	}
	cout << ans;
}