#include<bits/stdc++.h>
using namespace std;

int main(void)
{
	int n;
	cin >> n;
	vector<int>res(n);
	for (int i = 0; i < n; i++)cin >> res[i];
	sort(res.begin(), res.end());
	vector<int>::iterator end=unique(res.begin(), res.end());
	res.erase(end, res.end());
	for (vector<int>::iterator it = res.begin(); it != res.end(); it++)
		if (it == res.begin())cout << *it;
		else cout << " " << *it;
	cout << endl;
	return 0;
}

### Prompt

Your challenge is to write 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<bits/stdc++.h>
using namespace std;

int main(void)
{
	int n;
	cin >> n;
	vector<int>res(n);
	for (int i = 0; i < n; i++)cin >> res[i];
	sort(res.begin(), res.end());
	vector<int>::iterator end=unique(res.begin(), res.end());
	res.erase(end, res.end());
	for (vector<int>::iterator it = res.begin(); it != res.end(); it++)
		if (it == res.begin())cout << *it;
		else cout << " " << *it;
	cout << endl;
	return 0;
}

```