#include<bits/stdc++.h>
using namespace std;
int n, a[30], ans = 0;
void dfs(int sis, int bro, int i)
{
    if(sis == bro)
    {
        ans = max(ans, sis);
    }
    if(i > n)
    {
        return ;
    }
    dfs(sis + a[i], bro, i + 1);
    dfs(sis, bro + a[i], i + 1);
    dfs(sis, bro, i + 1);
}
int main()
{
    freopen("cookie.in","r",stdin);
    freopen("cookie.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    dfs(0, 0, 1);
    cout << ans;
    return 0;
}