#include<iostream>
#include<vector>
using namespace std;

int main()
{
	int n;
	cin >> n;

	vector<int> a;

	for (int i = 0; i < n; i++) {
		int b;
		cin >> b;

		if (i == 0) {
			a.push_back(b);
		}
		else if (i > 0 && a[a.size() - 1] != b) {
			a.push_back(b);
		}
	}

	cout << a[0];

	for (int i = 1; i < a.size(); i++) {
		cout << " " << a[i];
	}

	cout << endl;

	return 0;
}

### Prompt

Your task is to create 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;
	cin >> n;

	vector<int> a;

	for (int i = 0; i < n; i++) {
		int b;
		cin >> b;

		if (i == 0) {
			a.push_back(b);
		}
		else if (i > 0 && a[a.size() - 1] != b) {
			a.push_back(b);
		}
	}

	cout << a[0];

	for (int i = 1; i < a.size(); i++) {
		cout << " " << a[i];
	}

	cout << endl;

	return 0;
}

```