#include<set>
#include<iostream>
using namespace std;
int main()
{
	
	int n, i;
	cin >> n;
	int a[n];
	set<int> cpp;
	for (i = 0; i < n; i++)
	{
		cin >> a[i];
		cpp.insert(a[i]);
	}
	set<int>::iterator	iter = cpp.begin();
	for (iter; iter != cpp.end(); iter++)
	{
		if (iter!=cpp.begin())
			cout<< " ";
		cout << *iter;
	}
        cout<<endl;
	return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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<set>
#include<iostream>
using namespace std;
int main()
{
	
	int n, i;
	cin >> n;
	int a[n];
	set<int> cpp;
	for (i = 0; i < n; i++)
	{
		cin >> a[i];
		cpp.insert(a[i]);
	}
	set<int>::iterator	iter = cpp.begin();
	for (iter; iter != cpp.end(); iter++)
	{
		if (iter!=cpp.begin())
			cout<< " ";
		cout << *iter;
	}
        cout<<endl;
	return 0;
}

```