#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repd(i,a,b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main(void)
{
	int n, a;
	set<int> A;
	cin >> n;
	rep(i, n)
	{
		cin >> a;
		A.insert(a);
	}
	
	set<int>::iterator itr;
    for(itr = A.begin(); itr != A.end(); itr++) {
        if (itr != A.begin())
        {
            cout << " " ;
        }
        std::cout << *itr;
    }
	cout << endl;
}


### Prompt

Please provide a Cpp coded solution 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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repd(i,a,b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main(void)
{
	int n, a;
	set<int> A;
	cin >> n;
	rep(i, n)
	{
		cin >> a;
		A.insert(a);
	}
	
	set<int>::iterator itr;
    for(itr = A.begin(); itr != A.end(); itr++) {
        if (itr != A.begin())
        {
            cout << " " ;
        }
        std::cout << *itr;
    }
	cout << endl;
}


```