import java.util.Scanner;
public class Main {
    public static void main(String[] args){
    
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[]w = new int[n];
 
    int all = 0;
    for(int i=0; i<n; i++){
        w[i] = sc.nextInt();
        all += w[i];
    }
    int mae = 0;
    int cou = 0;
    for(int i=0; i<n; i++) {
    	if(mae*2 < all) {
    		mae += w[i];
    		cou++;
    	}
    }
    int A = all-mae-mae;
    A = Math.abs(A);
    int B = all-(mae-w[cou-1])-(mae-w[cou-1]);
    B = Math.abs(B);
    
    System.out.println(Math.min(A, B));
    }
}

/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