#include <bits/stdc++.h>
using namespace std;

int main(){
	int n, b;
	scanf("%d", &n);
	set<int> a;
	for(int i = 0; i < n; i++) {
		scanf("%d", &b);
		a.insert(b);
	}
	for(auto itr = a.begin(); itr != a.end(); itr++) {
		if(itr == a.begin()) printf("%d", *itr);
		else printf(" %d", *itr);
	}
	printf("\n");
}


### Prompt

Please provide a Cpp coded solution 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 <bits/stdc++.h>
using namespace std;

int main(){
	int n, b;
	scanf("%d", &n);
	set<int> a;
	for(int i = 0; i < n; i++) {
		scanf("%d", &b);
		a.insert(b);
	}
	for(auto itr = a.begin(); itr != a.end(); itr++) {
		if(itr == a.begin()) printf("%d", *itr);
		else printf(" %d", *itr);
	}
	printf("\n");
}


```