#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e3+7;
const ll mod = 1e5+7;
int n, s;
int dp[N][N], a[N];

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
        s += a[i];//总时间
    }
    dp[0][0] = 1;
    for(int i = 1; i <= n; ++ i)
    {
        for(int j = 1; j <= s; ++ j)
        {
            dp[i][j] = dp[i-1][j] | dp[i-1][j-a[i]];//表示i台车，j分钟，第二种要第i台
        }
    }
    int ans = mod;
    for(int i = 1; i <= s; i ++)
    {
        if(dp[n][i])
        {
//选择两台机器中数值大的
            ans = min(ans, max(i, s-i));
        }
    }
    cout << ans << '\n';
    return 0;
}