#include <iostream>
#include <list>
#include <algorithm>
#include <set>

using namespace std;

int main()
{
	int n;
	cin >> n;
	
	set<int> A;
	int a;
	while (n--)
	{
		cin >> a;
		A.insert(a);
	}
	
	
	//删除多余等值元素 
	set<int>::iterator it1 = A.begin(), it2 = ++A.begin();
//	while (it2 != A.end())
//	{
//		if (*it1 == *it2)
//		{
//			A.erase(it2++);	
//		}
//		else
//		{
//			it1++;
//			it2++;
//		}
//	}


	//法2：调用库函数
//	A.unique();	
	
	
	//输出 
	it1 = A.begin();
	cout << *it1++;	
	while (it1 != A.end())
	{
		cout << ' ' << *it1++;
	}
	cout << endl;
}

### 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>
#include <list>
#include <algorithm>
#include <set>

using namespace std;

int main()
{
	int n;
	cin >> n;
	
	set<int> A;
	int a;
	while (n--)
	{
		cin >> a;
		A.insert(a);
	}
	
	
	//删除多余等值元素 
	set<int>::iterator it1 = A.begin(), it2 = ++A.begin();
//	while (it2 != A.end())
//	{
//		if (*it1 == *it2)
//		{
//			A.erase(it2++);	
//		}
//		else
//		{
//			it1++;
//			it2++;
//		}
//	}


	//法2：调用库函数
//	A.unique();	
	
	
	//输出 
	it1 = A.begin();
	cout << *it1++;	
	while (it1 != A.end())
	{
		cout << ' ' << *it1++;
	}
	cout << endl;
}

```