#include <iostream>
#include <vector>
#include <climits>

int main(){
    int n;
    std::cin >> n;
    std::vector<int> v;
    int a;
    int tmp = INT_MAX;
    for (int i = 0; i < n; i++){
        std::cin >> a;
        if (a == tmp) continue;
        tmp = a;
        v.push_back(a);
    }
    for (int i = 0; i < v.size(); i++){
        std::cout << v[i];
        if (i < v.size() - 1) std::cout << " ";
    }
    std::cout << std::endl;
}

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

int main(){
    int n;
    std::cin >> n;
    std::vector<int> v;
    int a;
    int tmp = INT_MAX;
    for (int i = 0; i < n; i++){
        std::cin >> a;
        if (a == tmp) continue;
        tmp = a;
        v.push_back(a);
    }
    for (int i = 0; i < v.size(); i++){
        std::cout << v[i];
        if (i < v.size() - 1) std::cout << " ";
    }
    std::cout << std::endl;
}

```