#include <bits/stdc++.h>
using namespace std;
bool c(int x,int y){
    return y<x;
}
int main() {
    int n;cin>>n;
    vector<int > p(n);
    for (int i = 0; i < n; ++i)
        cin>>p[i];
    auto it=unique(p.begin(),p.end());
    p.erase(it,p.end());
    int q=p.size();
    for (int i=0 ;i<q-1;++i)
        cout<<p[i]<<" ";
    cout<<p[q-1]<<endl;
    return 0;
}


### Prompt

Construct a cpp code solution to the problem outlined:

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;
bool c(int x,int y){
    return y<x;
}
int main() {
    int n;cin>>n;
    vector<int > p(n);
    for (int i = 0; i < n; ++i)
        cin>>p[i];
    auto it=unique(p.begin(),p.end());
    p.erase(it,p.end());
    int q=p.size();
    for (int i=0 ;i<q-1;++i)
        cout<<p[i]<<" ";
    cout<<p[q-1]<<endl;
    return 0;
}


```