#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main(){
    int n1;
    cin >> n1;
    vector<int>a1(n1);
    for(int i = 0;i < n1;++i){
        cin >> a1[i];
    }
    
    sort(a1.begin(),a1.end());
    std::vector<int>:: iterator it = unique(a1.begin(), a1.end());
    a1.resize(distance(a1.begin(), it));
    
    for(it = a1.begin();it != a1.end();++it){
        if(it != a1.begin()){
            cout << " ";
        }
        cout << *it;
    }
    cout << endl;
}

### Prompt

Your task is to create 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 <algorithm>
#include <vector>

using namespace std;

int main(){
    int n1;
    cin >> n1;
    vector<int>a1(n1);
    for(int i = 0;i < n1;++i){
        cin >> a1[i];
    }
    
    sort(a1.begin(),a1.end());
    std::vector<int>:: iterator it = unique(a1.begin(), a1.end());
    a1.resize(distance(a1.begin(), it));
    
    for(it = a1.begin();it != a1.end();++it){
        if(it != a1.begin()){
            cout << " ";
        }
        cout << *it;
    }
    cout << endl;
}

```