You've got a positive integer sequence a₁, a₂, ..., a_n. All numbers in the sequence are distinct. Let's fix the set of variables b₁, b₂, ..., b_m. Initially each variable b_i (1 ≤ i ≤ m) contains the value of zero. Consider the following sequence, consisting of n operations.

The first operation is assigning the value of a₁ to some variable b_x (1 ≤ x ≤ m). Each of the following n - 1 operations is assigning to some variable b_y the value that is equal to the sum of values that are stored in the variables b_i and b_j (1 ≤ i, j, y ≤ m). At that, the value that is assigned on the t-th operation, must equal a_t. For each operation numbers y, i, j are chosen anew.

Your task is to find the minimum number of variables m, such that those variables can help you perform the described sequence of operations.

The first line contains integer n (1 ≤ n ≤ 23). The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_k ≤ 10⁹).

It is guaranteed that all numbers in the sequence are distinct.

In a single line print a single number — the minimum number of variables m, such that those variables can help you perform the described sequence of operations.

If you cannot perform the sequence of operations at any m, print -1.