import java.util.Scanner;
public class Main {
    public static void main(String[] args){
    	 Scanner sc = new Scanner(System.in);
         int n = sc.nextInt();
         int[] a = new int[n];
         int all = 0;
         for(int i = 0; i < n; i++) {
        	 a[i] = sc.nextInt();
        	 all += a[i];
         }
         int mae = 0;
         int ushiro = all;
         int ans = 0;
         for(int i = 0; i < n; i++) {
        	 mae += a[i];
        	 ushiro -= a[i];
        	 if(mae >= ushiro) {
        		 int ansa = Math.abs(ushiro-mae);
        		 int ansb = Math.abs(ushiro-mae+2*a[i]);
        		 ans = Math.min(ansa, ansb);
        		 break;
        	 }
         }
         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