#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)

int main()
{
    ll n,temp;
    cin >> n;
    set<ll> a;
    rep(i, n){
        cin >> temp;
        a.insert(temp);
    }

{
    ll i;
    set<ll>::iterator itr;
    for(itr = a.begin(), i=0; itr != a.end(); ++itr, ++i)
    {
        cout << (i ? " " : "") << flush;
        cout << *itr << flush;
    }
}

    cout << endl;

    return 0;
}

### Prompt

In Cpp, your task is to solve 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;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)

int main()
{
    ll n,temp;
    cin >> n;
    set<ll> a;
    rep(i, n){
        cin >> temp;
        a.insert(temp);
    }

{
    ll i;
    set<ll>::iterator itr;
    for(itr = a.begin(), i=0; itr != a.end(); ++itr, ++i)
    {
        cout << (i ? " " : "") << flush;
        cout << *itr << flush;
    }
}

    cout << endl;

    return 0;
}

```