#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int> vec(n);
    vector<int>::iterator it;
    for (int i = 0; i < n; i++) {
        cin >> vec[i];
    }
    it=unique(begin(vec), end(vec));
    vec.erase(it, end(vec));
    for (it=begin(vec); it < end(vec); it++) {
        if (it == --end(vec))
            cout << *it << endl;
        else cout << *it << " ";
    }
}

### Prompt

Your challenge is to write a Cpp solution 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int> vec(n);
    vector<int>::iterator it;
    for (int i = 0; i < n; i++) {
        cin >> vec[i];
    }
    it=unique(begin(vec), end(vec));
    vec.erase(it, end(vec));
    for (it=begin(vec); it < end(vec); it++) {
        if (it == --end(vec))
            cout << *it << endl;
        else cout << *it << " ";
    }
}

```