import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int[] weight = new int[n];
		
		for(int i = 0; i < n; i++) {
			weight[i] = stdIn.nextInt();
		}
		
		int ans = Integer.MAX_VALUE;
		for(int i = 0; i < n-1; i++) {
			int sum1 = 0;
			int sum2 = 0;
			int j = 0;
			for( j = 0; j < i+1; j++) {
				sum1 += weight[j];
				}
			for(int k = j; k < n; k++) {
				sum2 += weight[k];
			}
			ans = Math.min(ans, Math.abs(sum1-sum2));
		}
		
		
		System.out.println(ans);
		
		
	}

}

/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