Problem Statement

You are given a sequence of length $N$, $A = (A_1, A_2, \dots, A_N)$, consisting of integers between $0$ and $9$, inclusive. Print all integers that appear at least $1$ time in the sequence $A$, in ascending order.

Constraints

• $1 \le N \le 100$.
• $0 \le A_i \le 9$ ($1 \le i \le N$).
• All input values are integers.

Input

The input is given in the following format:

$N$ $A_1$ $A_2$ $\dots$ $A_N$

Output

Print all integers that appear at least $1$ time in the sequence $A$, in ascending order, separated by newlines.

Do not print anything other than the result. (Do not print sentences prompting for input, etc.)

For the answer format, you may also refer to the practice problems and their sample solutions.

Sample 1

Sample Input 1

8
2 0 2 3 0 9 1 6

Sample Output 1

0
1
2
3
6
9

• When the integers that appear at least $1$ time are arranged in ascending order, they are $0, 1, 2, 3, 6, 9$, so print them in $6$ lines.

Sample 2

Sample Input 2

3
9 9 9

Sample Output 2

9

• The only integer that appears at least $1$ time is $9$, so print it in $1$ line.

Sample 3

Sample Input 3

10
3 1 4 1 5 9 2 6 5 3

Sample Output 3

1
2
3
4
5
6
9

• When the integers that appear at least $1$ time are arranged in ascending order, they are $1, 2, 3, 4, 5, 6, 9$, so print them in $7$ lines.