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

int main()
{
    int n,q,b,m,e;
    cin>>n;
    vector<int>a;
    REP(i,n){int x;cin>>x;a.push_back(x);}
    a.erase(unique(a.begin(),a.end()),a.end());
    REP(i,a.size())
    {
        if(i!=0)cout<<" ";
        cout<<a[i];
    }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,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) rep(i,0,n)

int main()
{
    int n,q,b,m,e;
    cin>>n;
    vector<int>a;
    REP(i,n){int x;cin>>x;a.push_back(x);}
    a.erase(unique(a.begin(),a.end()),a.end());
    REP(i,a.size())
    {
        if(i!=0)cout<<" ";
        cout<<a[i];
    }cout<<endl;
}

```