#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'
#define FINISH cerr << "FINISH" << endl;
#define debug(x) cerr << #x << " == " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200020;
void solve()
{
	int n, m;
	cin >> n;
	vector<int> d(n + 1, 0);
	for (int i = 1; i < n; i++) {
		cin >> d[i];
	}
	vector dp(n + 1, vector(2020, inf));
	for (int i = 0; i <= 2000; i++) {
		dp[1][i] = i;
	}
	for (int i = 1; i < n; i++) {
		for (int j = 0; j <= 2000; j++) {
			if (j + d[i] <= 2000) {
				dp[i + 1][j + d[i]] = min(dp[i + 1][j + d[i]], dp[i][j] + d[i]);
			}
			if (j - d[i] >= 0) {
				dp[i + 1][j - d[i]] = min(dp[i + 1][j - d[i]], dp[i][j]);
			}
		}
	}
	int ans = inf;
	for (int i = 0; i <= 2000; i++) {
		ans = min(ans, dp[n][i]);
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}