#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() { 
  ios::sync_with_stdio(false); cin.tie(0);
  int n;
  cin >> n;
  vector<int> t(n);
  for (auto& x : t) cin >> x;
  constexpr int M = 1000001;
  vector<int> dp(M, 0);
  dp[0] = 1;
  for (auto x : t) {
    for (int i = M - 1; i >= 0; i--) {
      if (i + x < M && dp[i]) dp[i + x] = 1;
    }
  }
  int total = accumulate(t.begin(), t.end(), 0);
  int ans = M * 2;
  for (int i = 0; i < M; i++) if (dp[i]) {
    ans = min(ans, max(i, total - i));
  }
  cout << ans << endl;
  return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll dp[111111];

void Main() {
  ll n;
  R n;
  ll a[n];
  rep(i,n) R a[i];
  ll sum=0;
  rep(i,n) sum+=a[i];
  mem(dp);
  dp[0]=1;
  rep(i,n) {
    rrep(j,100000) dp[j+a[i]]|=dp[j];
  }
  ll ans=MAX;
  rep(i,111111) {
    if(dp[i]) ans=min(ans,max(i,sum-i));
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
