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

int main(){
    int n;
    std::cin>>n;
    std::vector<int> an(n,0);

    for (int i = 0; i < n; i++)
    {
        std::cin>>an[i];
    }

    decltype(an)::iterator result=std::unique(an.begin(),an.end());//resultは重複要素が削除された数列の末尾のイテレータ

    an.erase(result,an.end());//uniqueだけでは要素数の削除は行われない
    for(int i=0;i<an.size();i++){
        std::cout<<(i? " ":"")<<an[i];
    }
    std::cout<<std::endl;
    return 0;

}


### 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<iostream>
#include<algorithm>
#include<vector>

int main(){
    int n;
    std::cin>>n;
    std::vector<int> an(n,0);

    for (int i = 0; i < n; i++)
    {
        std::cin>>an[i];
    }

    decltype(an)::iterator result=std::unique(an.begin(),an.end());//resultは重複要素が削除された数列の末尾のイテレータ

    an.erase(result,an.end());//uniqueだけでは要素数の削除は行われない
    for(int i=0;i<an.size();i++){
        std::cout<<(i? " ":"")<<an[i];
    }
    std::cout<<std::endl;
    return 0;

}


```