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++11 (judge verdict: Accepted)

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

int main(){
    int n;
    cin >> n;
    vector<int> v;
    for(int i=0; i<n; i++){
        int aa;
        cin >> aa;
        v.push_back(aa);
    }
    decltype(v)::iterator result = unique(v.begin(), v.end());

    // [v.begin(), result)の範囲に、重複を除いた結果が入っている。
    // 不要になった要素を削除
    v.erase(result, v.end());

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