#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	vector<int> p;
	for (int i = 0;i < n;i++)
	{
		int num;
		cin >> num;
		p.push_back(num);
	}
	sort(p.begin(), p.end());
	vector<int>::iterator p1 = unique(p.begin(), p.end());
	p.erase(p1, p.end());
	vector<int>::iterator pp=p.begin();
	while (pp != p.end())
	{
		cout << *pp;
		if (++pp == p.end())cout << endl;
		else cout << " ";
	}
}

### Prompt

Please create a solution in Cpp 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<vector>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	vector<int> p;
	for (int i = 0;i < n;i++)
	{
		int num;
		cin >> num;
		p.push_back(num);
	}
	sort(p.begin(), p.end());
	vector<int>::iterator p1 = unique(p.begin(), p.end());
	p.erase(p1, p.end());
	vector<int>::iterator pp=p.begin();
	while (pp != p.end())
	{
		cout << *pp;
		if (++pp == p.end())cout << endl;
		else cout << " ";
	}
}

```