#include <iostream>
#include <string.h>
using namespace std;

long a[100000];

int main()
{
	memset(a, 0, sizeof(a));

	int n, j = 0;
	cin >> n >> a[0];

	for (int i = 1; i < n; i++) {
		long k;
		cin >> k;

		if (k > a[j]) {
			a[j + 1] = k;
			j++;
		}
	}

	for (int i = 0; i < j; i++) {
		cout << a[i] << " ";
	}
	cout << a[j] << endl;

	return 0;
}

### Prompt

Your task is to create 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>
#include <string.h>
using namespace std;

long a[100000];

int main()
{
	memset(a, 0, sizeof(a));

	int n, j = 0;
	cin >> n >> a[0];

	for (int i = 1; i < n; i++) {
		long k;
		cin >> k;

		if (k > a[j]) {
			a[j + 1] = k;
			j++;
		}
	}

	for (int i = 0; i < j; i++) {
		cout << a[i] << " ";
	}
	cout << a[j] << endl;

	return 0;
}

```