#include <iostream>
using namespace std;
int main(void){
    int n = 0;
    cin >> n;
    long A[100000],B[100000];
    for(int i = 0; i < 100000; i++){
        A[i] = 0;
        B[i] = 0;
    }
    cin >> A[0];
    B[0] = A[0];
    int m = 1;
    for(int i = 1; i < n; i++){
        cin >> A[i];
        if(A[i] != A[i-1]){
            B[m] = A[i];
            m++;
        }
    }
    for(int i = 0; i < m-1; i++){
        cout << B[i] << " ";
    }
    cout << B[m-1] << endl;
    return 0;
}


### Prompt

Your task is to create 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>
using namespace std;
int main(void){
    int n = 0;
    cin >> n;
    long A[100000],B[100000];
    for(int i = 0; i < 100000; i++){
        A[i] = 0;
        B[i] = 0;
    }
    cin >> A[0];
    B[0] = A[0];
    int m = 1;
    for(int i = 1; i < n; i++){
        cin >> A[i];
        if(A[i] != A[i-1]){
            B[m] = A[i];
            m++;
        }
    }
    for(int i = 0; i < m-1; i++){
        cout << B[i] << " ";
    }
    cout << B[m-1] << endl;
    return 0;
}


```