#include<algorithm>
#include<string>
#include<vector>
#include<iostream>
#define rep(i,x,y) for(int i=x;i<y;i++)

using namespace std;
int main(){
  int n; cin>>n;
  vector<int>a(n); 
  rep(i,0,n){
    cin>>a[i];
  }
  a.erase(unique(a.begin(),a.end()),a.end());
  rep(i,0,a.size()-1){
    cout<<a[i]<<" ";
  }
  cout<<a[a.size()-1]<<endl;
  return 0;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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<algorithm>
#include<string>
#include<vector>
#include<iostream>
#define rep(i,x,y) for(int i=x;i<y;i++)

using namespace std;
int main(){
  int n; cin>>n;
  vector<int>a(n); 
  rep(i,0,n){
    cin>>a[i];
  }
  a.erase(unique(a.begin(),a.end()),a.end());
  rep(i,0,a.size()-1){
    cout<<a[i]<<" ";
  }
  cout<<a[a.size()-1]<<endl;
  return 0;
}

```