import java.util.*;

public class Main {
	Scanner sc = new Scanner(System.in);
	final int MOD = 1000000007;
	final int MAX = Integer.MAX_VALUE;
	final long LMAX = Long.MAX_VALUE;

	int max3(int a, int b, int c) {
		int max = ((a < b) ? b : a);
		return (max < c)? c : max;
	}
	
	void doIt() {
		int n = sc.nextInt();
		int w[] = new int[n + 1];
		w[0] = 0;
		for(int i = 1; i <= n; i++) {
			w[i] = w[i - 1];
			w[i] += sc.nextInt();
		}
		int min = MAX;
		for(int i = 0; i <= n; i++) {
			int val = Math.abs(w[n] - w[i] * 2); 
			min = (min > val) ? val : min;
		}
		System.out.println(min);
	}
	
	
	public static void main(String[] args) {
		new Main().doIt();
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz