#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
    int n;
    cin >> n;
    map<int, int> mp;
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        mp[a]++;
    }
    vector<int> b;
    for (pair<int, int> i : mp) b.emplace_back(i.first);
    for (int i = 0; i < b.size(); ++i) {
        if (i == 0) cout << b[0];
        else cout << " " << b[i];
    }
    cout << endl;
}


### Prompt

Develop a solution in CPP 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 <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
    int n;
    cin >> n;
    map<int, int> mp;
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        mp[a]++;
    }
    vector<int> b;
    for (pair<int, int> i : mp) b.emplace_back(i.first);
    for (int i = 0; i < b.size(); ++i) {
        if (i == 0) cout << b[0];
        else cout << " " << b[i];
    }
    cout << endl;
}


```