#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
inline void chkmax(int &a,int b){a=max(a,b);}
inline void chkmin(int &a,int b){a=min(a,b);}
inline int re()
{
    char c=getchar();
    int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
const int N=55,M=250010,lim=250000,INF=0x3f3f3f3f;
int n;
int a[N];
int dp[2][M];
int main()
{
    freopen("cookie.in","r",stdin);
    freopen("cookie.out","w",stdout);
    n=re();
    for(int i=1;i<=n;i++) a[i]=re();
    for(int i=1;i<=lim;i++) dp[0][i]=-INF;
    for(int i=1;i<=n;i++)
    {
        int bi=i&1;
        for(int j=0;j<=lim;j++) dp[bi][j]=dp[bi^1][j];
        for(int j=0;j<=lim;j++)
        {
            if(j+a[i]<=lim) chkmax(dp[bi][j+a[i]],dp[bi^1][j]+a[i]);
            int tmp=abs(j-a[i]);
            if(tmp<=lim) chkmax(dp[bi][tmp],dp[bi^1][j]+a[i]);
        }
    }
    printf("%d\n",dp[n&1][0]/2);
    return 0;
}