#include <stdio.h>
#define N 100000
int main(void){
    int n,i,a[N];
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d",&a[i]);
    a[n]=a[n-1]/2;
    for(i=0;i<n;i++){
        if(a[i]!=a[i+1]) {
            printf("%d",a[i]);
            if(i!=n-1) printf(" ");
            else printf("\n");
        }
    }
    
    return 0;
}


### Prompt

Create a solution in cpp for 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>
#define N 100000
int main(void){
    int n,i,a[N];
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d",&a[i]);
    a[n]=a[n-1]/2;
    for(i=0;i<n;i++){
        if(a[i]!=a[i+1]) {
            printf("%d",a[i]);
            if(i!=n-1) printf(" ");
            else printf("\n");
        }
    }
    
    return 0;
}


```