#include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)

int main() {
 UL N;scanf("%u",&N);
 vector<int> A(N); rep(i,N) scanf("%d",&A[i]);
 A.erase(unique(A.begin(),A.end()),A.end());
 rep(i,A.size()) {if(i)printf(" "); printf("%d",A[i]);}
 printf("\n");
 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<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)

int main() {
 UL N;scanf("%u",&N);
 vector<int> A(N); rep(i,N) scanf("%d",&A[i]);
 A.erase(unique(A.begin(),A.end()),A.end());
 rep(i,A.size()) {if(i)printf(" "); printf("%d",A[i]);}
 printf("\n");
 return 0;
}



```