Problem:
Unique

For a sequence of integers $A = \{a_0, a_1, ..., a_{n-1}\}$ which is sorted by ascending order, eliminate all equivalent elements.

Input

A sequence is given in the following format.

$n$
$a_0 \; a_1 \; ,..., \; a_{n-1}$

Output

Print the sequence after eliminating equivalent elements in a line. Separate adjacency elements by a space character.

Constraints

$1 \leq n \leq 100,000$

$-1000,000,000 \leq a_i \leq 1,000,000,000$

$a_0 \leq a_1 \leq ... \leq a_{n-1}$

Sample Input 1

4
1 2 2 4

Sample Output 1

1 2 4

Solution in JAVA (judge verdict: Accepted)

import java.util.ArrayList;
import java.util.LinkedHashSet;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner src = new Scanner(System.in);

		int n = src.nextInt();	//n要素数


		ArrayList<Integer> list = new ArrayList<>();	//list

		for(int i=0; i<n; i++) {
			list.add(src.nextInt());
		}


		LinkedHashSet<Integer> set = new LinkedHashSet<>(list);	//
		ArrayList<Integer> list2 = new ArrayList<>(set);


		for(int i=0; i<list2.size()-1; i++) {
			System.out.print(list2.get(i) + " ");
		}
		System.out.println(list2.get(list2.size()-1));
	}
}