#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

int main(void) {
  int compare, n, x, max;
  cin >> n;
  vector<int> v;
  
  for(int i = 0; i < n; i++) {
    cin >> x;
    v.push_back(x);
  }

  sort(v.begin(), v.end());

  compare = v[0];
  max = v[n - 1];
  if(compare == max) {
    cout << compare << endl;
  }
  else { 
    for(int i = 0; i < n; i++) {
      if(i == 0)
        cout << v[0] << " ";
    
      if(compare != v[i]) {
        compare = v[i];
        cout << v[i];
        if(compare != max)
          cout << " ";
      }
    }
    cout << endl;
  }
  
}

### Prompt

Please formulate 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 <vector>
#include <algorithm>
#include <iostream>

using namespace std;

int main(void) {
  int compare, n, x, max;
  cin >> n;
  vector<int> v;
  
  for(int i = 0; i < n; i++) {
    cin >> x;
    v.push_back(x);
  }

  sort(v.begin(), v.end());

  compare = v[0];
  max = v[n - 1];
  if(compare == max) {
    cout << compare << endl;
  }
  else { 
    for(int i = 0; i < n; i++) {
      if(i == 0)
        cout << v[0] << " ";
    
      if(compare != v[i]) {
        compare = v[i];
        cout << v[i];
        if(compare != max)
          cout << " ";
      }
    }
    cout << endl;
  }
  
}

```