#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int> A(n);

    for (int i = 0; i < n; i++)
    {
        cin >> A.at(i);
    }
    vector<int>::iterator uni = unique(A.begin(), A.end());
    for (vector<int>::iterator it = A.begin(); it != uni - 1; it++)
    {
        cout << *it << ' ';
    }
    // A.erase(unique(A.begin(), A.end()), A.end());
    // for (i = 0; i < (A.size() - 1); i++)
    // {
    //     cout << A.at(i) << ' ';
    // }
    cout << A.back() << endl;
}

### Prompt

In Cpp, your task is to solve 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 <vector>
#include <algorithm>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int> A(n);

    for (int i = 0; i < n; i++)
    {
        cin >> A.at(i);
    }
    vector<int>::iterator uni = unique(A.begin(), A.end());
    for (vector<int>::iterator it = A.begin(); it != uni - 1; it++)
    {
        cout << *it << ' ';
    }
    // A.erase(unique(A.begin(), A.end()), A.end());
    // for (i = 0; i < (A.size() - 1); i++)
    // {
    //     cout << A.at(i) << ' ';
    // }
    cout << A.back() << endl;
}

```