Problem:
Unique

For a sequence of integers $A = \{a_0, a_1, ..., a_{n-1}\}$ which is sorted by ascending order, eliminate all equivalent elements.

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.

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}$

Sample Input 1

4
1 2 2 4

Sample Output 1

1 2 4

Solution in C++14 (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    ll n, t;
    vector<ll> v;
    scanf("%lld", &n);
    for(ll i = 0; i < n; i++){
        scanf("%lld", &t);
        v.push_back(t);
    }
    v.erase(unique(v.begin(), v.end()), v.end());
    for(auto i = v.begin(); i != v.end(); i++){
        if(i != v.begin()){
            printf(" ");
        }
        printf("%lld", *i);
    }
    printf("\n");
    return 0;
}