[ The original version of this problem (in Spanish) can be found at http://dc.uba.ar/events/icpc/download/problems/tap2014-problems.pdf ]

This problem was included in this contest at the last minute, replacing another one that the jury could not fully prepare in time. We will not tell you much about the original problem because we will use it for the contest next year. We will only say that it was called "Playing with lists" because it deals with integer lists. The input for the problem was formed by L lists of integers, and its format was:

- a line with an integer N₁ indicating the amount of numbers in the first list;

- N₁ lines each representing an integer in the first list;

- a line with an integer N₂ indicating the amount of numbers in the second list;

- N₂ lines each representing an integer in the second list;

... 

- a line with an integer N_L indicating the amount of numbers in the last list;

- N_L lines each representing an integer in the last list.

In an unfortunate accident, Joaquin -a member of the jury- erased the first line of each input file (the one which contains N₁). We need your help to restore the input files so we can use the problem next year. Given the file without the first line, we ask you to tell us which are the possible values of N₁ such that, if we add a line with that value at the beginning, the resulting file will be a valid input according to the description given above.

Input

The first line contains an integer T (1 ≤ T ≤ 10⁵) which indicates the number of lines remaining in the input file. Each of the next T lines contains an integer R_i which represents the number left on the i-th line of the input file after the accident (1 ≤ R_i ≤ 10⁵ for i = 1, 2, ... , T). 

Output

Print a line for each possible value of N₁. Print all possible answers in increasing order.

Input:
5
3
1
2
4
5
Output:
2
5

Example 2

Input:
10
1
2
3
4
5
6
7
8
9
10
Output:
1
4
10