#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
vector<int>v;
int main() {
	int n;
	cin >> n;
	rep(i, n) {
		int a;
		cin >> a;
		v.push_back(a);
	}
	v.erase(unique(v.begin(), v.end()), v.end());
	rep(i, v.size())cout << v[i] << (i == v.size() - 1 ? "\n" : " ");
	return 0;
}

### 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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
vector<int>v;
int main() {
	int n;
	cin >> n;
	rep(i, n) {
		int a;
		cin >> a;
		v.push_back(a);
	}
	v.erase(unique(v.begin(), v.end()), v.end());
	rep(i, v.size())cout << v[i] << (i == v.size() - 1 ? "\n" : " ");
	return 0;
}

```