class Solution {
	public int solution(int[] A) {
		int[] P = new int[A.length];
		int sum = 0;
		for (int i = 0; i < A.length; ++i) {
			sum += A[i];
		}
		P[0] = sum;
		int min = Integer.MAX_VALUE;
		for (int i = 1; i < A.length; ++i) {
			P[i] = P[i - 1] - 2 * A[i - 1];
			min = Math.min(min, Math.abs(P[i]));
		}
		return min;
	}
}