#include<bits/stdc++.h>
#define N 55
#define M 500005
#define db double
#define ui unsigned
#define ul unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define fo(i,l,r) for(int i=(l);i<=(r);i++)
#define rf(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int T,n,m,k,last,ans,op,x,y,z;
int a[N],s[N],f[2][M<<1];
const int eps=5e5;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int fp(int a,int n,int mod){
	int ans=1;
	while(n){
		if(n&1)ans=ans*a%mod;
		a=a*a%mod;
		n>>=1;
	}
	return ans;
}
int sub(int x,int y){return x>y?x-y:y-x;}
int ab(int x){return x<0?-x:x;}
int po(int x){return x*x;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum; 
}
signed main(){
	freopen("cookie.in","r",stdin);freopen("cookie.out","w",stdout);
	n=read();fo(i,1,n)a[i]=read(),s[i]=s[i-1]+a[i];
	fo(i,0,n-1){
		memset(f[i&1^1],-1,sizeof(f[i&1^1]));
		fo(j,eps-s[i],eps+s[i]){
			x=f[i&1][j];
			if(x==-1)continue;
			ckmax(f[i&1^1][j+a[i+1]],x+a[i+1]);
			ckmax(f[i&1^1][j],x);
			ckmax(f[i&1^1][j-a[i+1]],x);
		}
	}
	printf("%d",max(0,f[n&1][eps]));
	return 0;
}