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

int n, x=1, temp=1;

int main() {
    cin >> n;
    int a[n];
    for (int i=0; i<n; i++) cin >> a[i];
    int b[n];
    for (int i=0; i<n; i++) b[i] = -1;
    b[0] = a[0];
    for (int i=1; i<n; i++) {
        if (a[i] == b[x-1]) temp =0;
        else {b[x] = a[i];
        x++;} temp = 1;
    }
    for (int i=0; i<x-1; i++) cout << b[i] << " ";
    cout << b[x-1] << 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 <bits/stdc++.h>
using namespace std;

int n, x=1, temp=1;

int main() {
    cin >> n;
    int a[n];
    for (int i=0; i<n; i++) cin >> a[i];
    int b[n];
    for (int i=0; i<n; i++) b[i] = -1;
    b[0] = a[0];
    for (int i=1; i<n; i++) {
        if (a[i] == b[x-1]) temp =0;
        else {b[x] = a[i];
        x++;} temp = 1;
    }
    for (int i=0; i<x-1; i++) cout << b[i] << " ";
    cout << b[x-1] << endl;
} 

```