#include <string>
#include <iostream>
#include <stdio.h>
#include <vector>

using namespace std;

int main() {
  ios::sync_with_stdio(false);

  int n;
  cin >> n;

  vector<int> v;
  int last_num, tmp;
  for (int i = 0; i < n; i++) {
    cin >> tmp;

    if (i == 0) {
      last_num = tmp;
      v.push_back(tmp);
      continue;
    }

    if (last_num != tmp) {
      v.push_back(tmp);
      last_num = tmp;
    }
  }

  for (int i = 0; i < v.size(); i++) {
    if (i) {
      cout << " ";
    }
    cout << v[i];
  }
  cout << endl;
}



### Prompt

Develop a solution in CPP 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 <string>
#include <iostream>
#include <stdio.h>
#include <vector>

using namespace std;

int main() {
  ios::sync_with_stdio(false);

  int n;
  cin >> n;

  vector<int> v;
  int last_num, tmp;
  for (int i = 0; i < n; i++) {
    cin >> tmp;

    if (i == 0) {
      last_num = tmp;
      v.push_back(tmp);
      continue;
    }

    if (last_num != tmp) {
      v.push_back(tmp);
      last_num = tmp;
    }
  }

  for (int i = 0; i < v.size(); i++) {
    if (i) {
      cout << " ";
    }
    cout << v[i];
  }
  cout << endl;
}



```