For given set of 2N-1 integers check if any N of them form a sequence of consecutive integer numbers.
Input consists of several test cases.
Each test case consists of two lines. In the first line there is only one integer value N
(1 <= N <= 100.000). In the second line there are 2N-1
non-negative integers, not grater than 2.000.000.000.
Input ends with a special test case, where N is equal to 0 and there is no second line
- do not process this case!
For each test case output a line with one word "YES" or "NO", saying whether the set contains N consecuitive integers.
1 3 2 5 3 1 4 10 1 7 3 9 5 8 0
YES NO YES