You have a number of stones with known weights w₁, …, w_n. Write a program that will rearrange the stones into two piles such that weight difference between the piles is minimal.

Input

Input contains the number of stones n (1 ≤ n ≤ 32) and weights of the stones w₁, …, w_n (integers, 1 ≤ w_i ≤ 10⁷) delimited by white spaces.

Output

Your program should output a number representing the minimal possible weight difference between stone piles.

Sample

5

5 8 13 27 14

3