#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N;
    cin >> N;

    vector<int> num(N);
    for (int i = 0; i < N; ++i) {
        cin >> num[i];
    }

    vector<int>::iterator result = unique(num.begin(), num.end());
    num.erase(result, num.end());

    for (int i = 0; i < num.size(); ++i) {
        cout << num.at(i);
        if (i < num.size() - 1) {
            cout << " ";
        }
    }
    cout << endl;

    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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N;
    cin >> N;

    vector<int> num(N);
    for (int i = 0; i < N; ++i) {
        cin >> num[i];
    }

    vector<int>::iterator result = unique(num.begin(), num.end());
    num.erase(result, num.end());

    for (int i = 0; i < num.size(); ++i) {
        cout << num.at(i);
        if (i < num.size() - 1) {
            cout << " ";
        }
    }
    cout << endl;

    return 0;
}

```