#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#define int long long
using namespace std;
signed main() {
	int n; cin >> n;
	set<int>s;
	for (int i = 0; i < n; i++) {
		int a; cin >> a;
		s.insert(a);
	}
	for (auto i = s.begin(); i != s.end(); i++) {
		if (i != s.begin())cout << ' ';
		cout << *i;
	}cout << endl;
}

### 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 <algorithm>
#include <vector>
#include <set>
#define int long long
using namespace std;
signed main() {
	int n; cin >> n;
	set<int>s;
	for (int i = 0; i < n; i++) {
		int a; cin >> a;
		s.insert(a);
	}
	for (auto i = s.begin(); i != s.end(); i++) {
		if (i != s.begin())cout << ' ';
		cout << *i;
	}cout << endl;
}

```