#include <stdio.h>
int main(){
    int n,last,temp;
    scanf("%d%d",&n,&last);
    printf("%d",last);
    for(int i=1;i<n;i++){
        scanf("%d",&temp);
        if(temp!=last){
            last=temp;
            printf(" %d",temp);
        }
    }
    printf("\n");
}

### Prompt

Construct a cpp code solution to the problem outlined:

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(){
    int n,last,temp;
    scanf("%d%d",&n,&last);
    printf("%d",last);
    for(int i=1;i<n;i++){
        scanf("%d",&temp);
        if(temp!=last){
            last=temp;
            printf(" %d",temp);
        }
    }
    printf("\n");
}

```