#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<cstring>
using namespace std;
const int N=55,M=5e5+5;
int a[N];
int n,sum=0;
int ans=0;
void dfs(int x,int sa,int sb){
    if(x==n+1){
//        cout<<sa<<" "<<sb<<"\n";
        if(sa==sb){
            ans=max(ans,sa);
        }
        return;
    }
    if(sa>sum/2||sb>sum/2)  return;
    dfs(x+1,sa,sb);
    dfs(x+1,sa+a[x],sb);
    dfs(x+1,sa,sb+a[x]);
}
int main(){
    freopen("cookie.in","r",stdin);
    freopen("cookie.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        sum+=a[i];
    }
    dfs(1,0,0);
    cout<<ans;
    return 0;
}