#include <algorithm>
// #include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    ll sum_a = 0;
    for (ll i = 0; i < N; i++) {
        sum_a += A[i];
    }
    ll max_val;
    // 数え上げ問題として解く。2 通り以上であれば OK
    if (N <= 60) {
        max_val = N * 5000;
    } else {
        max_val = 4 * 5000;
    }
    vector<ll> dp1(max_val + 1, 0);
    vector<ll> dp2(max_val + 1, 0);
    dp1[0] = 1;
    dp2[0] = 1;

    ll m1 = 1000000000 + rand() % 100000;
    ll m2 = 1000200000 + rand() % 100000;
    for (ll i = 0; i < N; i++) {
        vector<ll> ndp1(max_val + 1, 0);
        vector<ll> ndp2(max_val + 1, 0);
        for (ll j = 0; j <= max_val; j++) {
            if (j + A[i] <= max_val) {
                ndp1[j + A[i]] += dp1[j];
                ndp1[j + A[i]] %= m1;
                ndp2[j + A[i]] += dp2[j];
                ndp2[j + A[i]] %= m2;
            }
            ndp1[j] += dp1[j];
            ndp2[j] += dp2[j];
            ndp1[j] %= m1;
            ndp2[j] %= m2;
        }
        for (ll j = 0; j <= max_val; j++) {
            dp1[j] = ndp1[j];
            dp2[j] = ndp2[j];
        }
    }
    ll ans = -1;
    for (ll j = 0; j <= max_val; j++) {
        if (!(dp1[j] <= 1 && dp2[j] <= 1)) {
            ans = j;
            break;
        }
    }
    if (ans != -1 && ans * 2 < sum_a) {
        cout << sum_a - ans * 2 << endl;
    } else {
        cout << -1 << endl;
    }
}