Skip to content
UPEEC

Remove Duplicates

Easy#arrays#hashing· solved by 0 · time limit 2.0 s

Print the array keeping only the first occurrence of each value, in the original order.

Input

nn, then nn integers.

Output

The array without duplicates.

Constraints

1≤n≤1051 \le n \le 10^5

Sample 1

Input

5
3 1 3 2 1

Output

3 1 2

Sign in or join free to run and submit your solution.