#include <algorithm>
#include <iostream>

int main(int argc, char *argv[]) {
  int n;
  std::cin >> n;
  long long a[100001];
  for (int i = 0; i < n; ++i)
    std::cin >> a[i];
  const long long *end = std::unique(a, a + n);

  for (auto i = a; i != end; ++i) {
    if (i > a)
      std::cout << " ";
    std::cout << *i;
  }
  std::cout << std::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 <algorithm>
#include <iostream>

int main(int argc, char *argv[]) {
  int n;
  std::cin >> n;
  long long a[100001];
  for (int i = 0; i < n; ++i)
    std::cin >> a[i];
  const long long *end = std::unique(a, a + n);

  for (auto i = a; i != end; ++i) {
    if (i > a)
      std::cout << " ";
    std::cout << *i;
  }
  std::cout << std::endl;
}


```