import java.util.Scanner;

public class Main {
  private static void solve(int n, int[] m) {
    int[] sum = new int[n];
    for (int i = 0; i < n; i++) {
      sum[i] =  m[i] + (i > 0 ? sum[i - 1] : 0);
    }
    int minDiff = Integer.MAX_VALUE;
    for (int i = 1; i < n - 1; i++) {
      minDiff = Math.min(
        minDiff,
        Math.abs(sum[n - 1] - 2 * sum[i]));
    }
    System.out.println(minDiff);
  }
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = Integer.parseInt(sc.nextLine());
    String[] ms = sc.nextLine().split(" ");
    int[] m = new int[n];
    for (int i = 0; i < n; i++) m[i] = Integer.parseInt(ms[i]);
    solve(n, m);
  }
}

/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