#include <iostream>

int main()
{
	int n; std::cin >> n;
	int* A = new int[n];
	for (int i=0; i<n; i++) std::cin >> A[i];

	std::cout << A[0];
	int pre = A[0];
	for (int i=1; i<n; i++) {
		if (pre != A[i]) {
			std::cout << " " << A[i];
			pre = A[i];
		}
	}
	std::cout << std::endl;
	
	delete[] A;
	
	return 0;
}


### Prompt

Please formulate a Cpp solution to the following problem:

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

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}$

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.

Example

Input

4
1 2 2 4


Output

1 2 4

### Response

```cpp
#include <iostream>

int main()
{
	int n; std::cin >> n;
	int* A = new int[n];
	for (int i=0; i<n; i++) std::cin >> A[i];

	std::cout << A[0];
	int pre = A[0];
	for (int i=1; i<n; i++) {
		if (pre != A[i]) {
			std::cout << " " << A[i];
			pre = A[i];
		}
	}
	std::cout << std::endl;
	
	delete[] A;
	
	return 0;
}


```