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

using namespace std;

int main(){
    int len_array;
    scanf("%d",&len_array);
    vector<int> int_array(len_array);
    for(int i = 0; i< len_array;i++){
        cin >> int_array[i];
    }
    vector<int>::iterator results = unique(int_array.begin(),int_array.end());
    
    for(vector<int>::iterator itr = int_array.begin();itr != results; itr++){
        cout << *itr;
        if(itr != results-1) cout << " ";
        else cout << "\n";
    }
    
    return 0;
}

### Prompt

Please create a solution in cpp 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<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main(){
    int len_array;
    scanf("%d",&len_array);
    vector<int> int_array(len_array);
    for(int i = 0; i< len_array;i++){
        cin >> int_array[i];
    }
    vector<int>::iterator results = unique(int_array.begin(),int_array.end());
    
    for(vector<int>::iterator itr = int_array.begin();itr != results; itr++){
        cout << *itr;
        if(itr != results-1) cout << " ";
        else cout << "\n";
    }
    
    return 0;
}

```