A regional foundry issues permit numbers to its licensed workshops starting at 1 and always counting upward. Over the years some permits have been revoked and struck from the active ledger, while newly issued permits keep raising the highest number ever granted. You are given the complete list of permit numbers that are currently active, each appearing at most once. Find every permit number from 1 up to the highest currently active number that does NOT appear on the active list — these gaps mark revoked or never-reissued permits — and report them in ascending order.

Input format

Line 1: a single integer n, the number of active permit numbers. Line 2: n distinct integers, the active permit numbers, separated by spaces.

Output format

The gap numbers, in ascending order, separated by single spaces on one line. If there are no gaps, print an empty line.

Constraints

• 1 <= n <= 100
• 1 <= each permit number <= 100
• All permit numbers on line 2 are distinct.

3
2 5 6

1 3 4

1
4

1 2 3