// https://szkopul.edu.pl/problemset/problem/fh8k3DcWsZB3OwD8rSLJw7SQ/site/?key=statement

#include <bits/stdc++.h>

using namespace std;

#define int long long

// #define GARY_DBG

constexpr int sizik = 5 * 1000 * 1001;

#define ar std::array
#define pr std::pair
#define vec std::vector

typedef vec<vec<int>> _kra;

std::bitset<sizik> plecak;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> v(n);
    for (auto& a : v) {
        std::cin >> a;
    }

    std::sort(v.begin(), v.end());

    int maxi = v.back();
    v.pop_back();

    std::map<int, int> m;
    std::priority_queue<int, vec<int>, greater<int>> q;
    for (const auto& a : v) {
        m[a]++;
        q.push(a);
    }

    while (!q.empty()) {
        int x = q.top();
        q.pop();

        while (m[x] >= 3) {
            m[x] -= 2;
            q.push(2 * x);
            m[2 * x]++;
        }
    }

    std::vector<int> elements;
    int sum = 0;
    for (const auto& [a, b] : m) {
        for (int i = 0; i < b; i++) {
            elements.push_back(a);
            sum += a;
        }
    }

    plecak[0] = true;
    for (const auto& a : elements) {
        plecak = plecak | (plecak << a);
    }

    int val = sum / 2;

    int w = 0;
    for (int i = val; i >= 0; i--) {
        if (plecak[i]) {
            w = i;
            break;
        }
    }

    int ans = w + maxi;

    std::cout << ans << '\n';
}

int32_t main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);

    int t = 1;
    // std::cin >> t;

    for (; t > 0; t--) {
        solve();
    }

    return 0;
}