19362번 - Coins 2 다국어

문제

In ICPCCamp, people usually use coins of values 1,ドル 2, 3, \dots, n$.

Bobo was very poor, he had only $a_1, a_2, a_3, \dots, a_n$ coins of values 1,ドル 2, 3, \dots, n,ドル respectively. He bought an item of an unknown value without making change.

The unknown item was of non-negative integer value. Find the number of possible values it may have had.

입력

The input contains zero or more test cases, and is terminated by end-of-file. For each test case:

The first line contains one integer $n$ (1ドル \leq n \leq 15$).

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ (0ドル \leq a_i \leq 10^9$).

It is guaranteed that the number of test cases does not exceed 100ドル,ドル and there is at most one test case where $n > 10$.

출력

For each test case, output an integer which denotes the number of possibilities.

제한

힌트