#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin >> n;
	vector<int> a(n);
	for(int i=0; i<n; i++) cin >> a[i];
	const int sz = 16000005;
	vector<bitset<sz>> dp(n+1);
	for(int i=0; i<n; i++){
		auto ndp = dp;
		for(int j=0; j<=n; j++){
			if(j != 0) ndp[j-1] |= dp[j]>>a[i];
			if(j != n) ndp[j+1] |= dp[j]<<a[i];
		}
		swap(ndp, dp);
		dp[n/2+1].set(sz/2+a[i], 1);
	}
	int ans = 1e9;
	for(int i=0; i<sz; i++){
		if(dp[n/2].test(i)) ans = min(ans, max(sz/2-i, i-sz/2));
	}
	cout << ans << endl;
}