Remove repeats, keep first order

Problem

A canteen machine logged the order numbers of every snack sold, with repeats. The manager wants each snack number once, in the order it was first sold.

Input, output and limits

Input: The first line has n. The second line has n integers: the snack numbers.
Output: One line: the different snack numbers in order of first appearance, separated by spaces.
Constraints: 1 ≤ n ≤ 1000
-10^6 ≤ snack number ≤ 10^6

Examples

Example

Input

8
4 2 4 7 2 9 7 4

Output

4 2 7 9

Later copies of 4, 2 and 7 are dropped.

Hints

Try the problem first. Open one hint at a time.

Hint 1

Keep a second array unique and a count size of how many values it holds.

Hint 2

For each number, search unique[0..size-1]; add it only if it is not there yet.

Write your Java code, run it on the examples and submit it to hidden tests.

Solve in the editor

Rotate a queue right by kmedium
Common and combined roll numbersmedium
Find the missing roll numbermedium
Class monitor electionhard
Even numbers first, each part sortedmedium

All Java problems

Problem

Input, output and limits

Examples

Hints

More Arrays problems

Problem

Input, output and limits

Examples

Hints

More Arrays problems