#include<bits/stdc++.h>
//#define int long long
using namespace std;
int n,a[101],sum,ans;
int h[101];
int ls[101];
void dfs(int d,int x,int y){
    if(x>sum/2)return;
    if(x+h[d]<ans)return;
    if(d==n+1){
        if(x==sum-x-y){
//            for(int i=1;i<=n;i++){
//                if(ls[i]==1)cout<<a[i]<<" ";
//            }
//            cout<<"\n";
//            for(int i=1;i<=n;i++){
//                if(ls[i]==0)cout<<a[i]<<" ";
//            }
//            cout<<"\n";cout<<"\n";
            ans=max(ans,x);
        }
        return;
    }
    ls[d]=1;
    dfs(d+1,x+a[d],y);
    ls[d]=2;
    dfs(d+1,x,y+a[d]);
    ls[d]=0;
    dfs(d+1,x,y);
}
signed 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];
    }
    sort(a+1,a+n+1);
    for(int i=n;i>=0;i--){
        h[i]=h[i+1]+a[i];
    }
    dfs(1,0,0);
    cout<<ans;
    return 0;
}