int n, a[21], sum, ans;
bool dp[MAXN];

int main() {
	fastIO();
	cin >> n;
	ans = MAXN;
	for(int i = 0; i < n; i++){
		cin >> a[i];
		sum += a[i];
	}
	dp[0] = 1;
	for(int i = 0; i < n; i++){
		for(int j = MAXN; j >= 0; j--){
			if(dp[j])
				dp[j + a[i]] = 1;
		}
	}
	for(int i = 0; i < MAXN; i++){
		if(dp[i])
			ans = min(ans, abs(i - (sum - i)));
	}
	cout << ans;
	return 0;
}