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.*;
import java.io.*;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int size = in.nextInt(), arr[] = new int[size];

		arr[0] = Integer.parseInt(in.next());
		int tail = 0;

		for(int i = 1; i < size; i++) {
			int x = Integer.parseInt(in.next());

			if(x != arr[tail]) {
				arr[++tail] = x;
			}
		}

		for(int i = 0; i <= tail; i++) {
			out.printf("%d%s", arr[i], (i < tail) ? " " : "\n");
		}
		out.flush();
		in.close();
	}

}