//By Don4ick #include const int N = 45; using namespace std; int n; long long a[N]; int main() { // freopen(".in", "r", stdin); // freopen(".out", "w", stdout); long long ans = 0, cur = 1; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); for (int i = n; i >= 1; i--) { ans += cur * a[i]; cur *= 2; } cout << ans << endl; return 0; }