#include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int N=,M=;

 int n,sum,ans,half;

 int a[N],dp[M];

 bool cmp(int a,int b)

 {

     return a>b;

 }

 int main ()

 {

     scanf("%d",&n);

     for(int i=;i<=n;i++)

         scanf("%d",&a[i]),sum+=a[i];

     half=sum/,sort(a+,a++n,cmp);

     for(int i=;i<=n;i++)

         for(int j=sum;~j;j--)

         {

             if(j>=a[i]) dp[j]=max(dp[j],dp[j-a[i]]+a[i]);

             if(dp[j]>half&&dp[j]-a[i]<=half) ans=max(ans,dp[j]);

         }

     printf("%d",ans);

     return ;

 }