#include <stdio.h>

int main(void)
{
    int n;
    int x;
    int count = 1;
    int i;
    int tmp;
    int a[100005] = {};
    
    
    scanf("%d",&n);
    scanf("%d",&a[0]);
    tmp = a[0];
    
    for(i = 1; i < n; i++)
    {
        scanf("%d", &x);
        if(tmp != x)
        {
            tmp = x;
            a[count++] = x;
        }
    }
    
    for(i = 0; i < count - 1; i++)
    {
        printf("%d ", a[i]);
    }
    
    printf("%d\n", a[count - 1]);
    
    return 0;
}


### 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 <stdio.h>

int main(void)
{
    int n;
    int x;
    int count = 1;
    int i;
    int tmp;
    int a[100005] = {};
    
    
    scanf("%d",&n);
    scanf("%d",&a[0]);
    tmp = a[0];
    
    for(i = 1; i < n; i++)
    {
        scanf("%d", &x);
        if(tmp != x)
        {
            tmp = x;
            a[count++] = x;
        }
    }
    
    for(i = 0; i < count - 1; i++)
    {
        printf("%d ", a[i]);
    }
    
    printf("%d\n", a[count - 1]);
    
    return 0;
}


```