#include<iostream>
#include<vector>
using namespace std;
int main(){
	int n;
	vector<int>v;
	cin>>n;
	int A[n];
	for(int i=0; i<n; i++)
		cin>>A[i];
	v.push_back(A[0]);
	for(int i=1; i<n; i++){
		if(A[i]!=A[i-1])
			v.push_back(A[i]);
	}
	cout<<v[0];
	for(int i=1; i<v.size(); i++)
		cout<<" "<<v[i];
	cout<<endl;
	return 0;
}

### Prompt

Generate 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<iostream>
#include<vector>
using namespace std;
int main(){
	int n;
	vector<int>v;
	cin>>n;
	int A[n];
	for(int i=0; i<n; i++)
		cin>>A[i];
	v.push_back(A[0]);
	for(int i=1; i<n; i++){
		if(A[i]!=A[i-1])
			v.push_back(A[i]);
	}
	cout<<v[0];
	for(int i=1; i<v.size(); i++)
		cout<<" "<<v[i];
	cout<<endl;
	return 0;
}

```