Given n positive integers, is it possible to divide them into pairs so that the sum of each pair is the same?
输入解释
The input contains several test cases. The first line of each case contains a single integer n (2 ≤ n ≤ 100). The second line contains n positive integers not greater than 1000. These numbers are sorted in non-decreasing order. The last case is followed by a single zero, which should not be processed.
输出解释
For each case, output ‘Yes’ or ‘No’ depending on whether or not the pairing is possible.