#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <limits.h>
using namespace std;

const int inf = INT_MAX / 2; // 代わりに2^31-1の大きな値
const int mod = 998244353;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    
    // 配列をシャッフル
    random_device rd;
    mt19937 g(rd());
    int ans = -1;
    vector<vector<int>> dp0(n + 1, vector<int>(6001, -inf));
    vector<vector<int>> dp1(n + 1, vector<int>(6001, -inf));
    for(int _ = 0; _ < 10; _++){
        shuffle(a.begin(), a.end(), g);
        //dpの初期化
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= 6000; j++) {
                dp0[i][j] = -inf;
                dp1[i][j] = -inf;
            }
        }
        dp0[0][0] = 0;
        
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= 6000; j++) {
                dp0[i + 1][j] = max(dp0[i + 1][j], dp0[i][j] + a[i]);
                dp1[i + 1][j] = max(dp1[i + 1][j], dp1[i][j] + a[i]);
                dp1[i + 1][abs(j - a[i])] = max(dp1[i + 1][abs(j - a[i])], dp1[i][j]);
                dp1[i + 1][abs(j - a[i])] = max(dp1[i + 1][abs(j - a[i])], dp0[i][j]);
                if (j + a[i] <= 6000) {
                    dp1[i + 1][j + a[i]] = max(dp1[i + 1][j + a[i]], dp1[i][j]);
                    dp1[i + 1][j + a[i]] = max(dp1[i + 1][j + a[i]], dp0[i][j]);
                }
            }
        }
        
        ans = max(ans, dp1[n][0] <= 0 ? -1 : dp1[n][0]);
    }

    cout << ans << endl;
    
    return 0;
}