#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,q;
int main()
{
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++)cin>>a[i];
	a.erase(unique(a.begin(),a.end()),a.end());
	for(int i=0;i<a.size();i++)cout<<(i?" ":"")<<a[i];
	cout<<endl;
}

### 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<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,q;
int main()
{
	cin>>n;
	vector<int>a(n);
	for(int i=0;i<n;i++)cin>>a[i];
	a.erase(unique(a.begin(),a.end()),a.end());
	for(int i=0;i<a.size();i++)cout<<(i?" ":"")<<a[i];
	cout<<endl;
}

```