#include<bits/stdc++.h>
using namespace std;

const int N = 55;
const int V = 5 * 1e5 + 5;
int n;
int dp[V], nxt[V];
int a[N], cnt = 0;

int main(){
    freopen("cookie.in", "r", stdin);
    freopen("cookie.out", "w", stdout);
    cin.tie(0) -> ios::sync_with_stdio(0); 
    cin >> n;
    for(int i = 1;i <= n;i ++) cin >> a[i];
    memset(dp, -1, sizeof(dp));
    dp[0] = 0;
    for(int i = 1;i <= n;i ++){
        int x = a[i];
        for(int j = 0;j <= cnt;j ++) nxt[j] = dp[j];
        for(int j = cnt + 1;j <= cnt + x;j ++) nxt[j] = -1;
        for(int j = 0;j <= cnt;j ++){
            if(dp[j] == -1) continue;
            int v = dp[j]; nxt[j + x] = max(nxt[j + x], v);
            if(j >= x) nxt[j - x] = max(nxt[j - x], v + x);
            else nxt[x - j] = max(nxt[x - j], v + j);
        }
        cnt += x; for(int j = 0;j <= cnt;j ++) dp[j] = nxt[j];
    }
    cout << max(0, dp[0]) << '\n';
    return 0;
}