Problem: Find the union of two sets $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and $B = \\{b_0, b_1, ..., b_{m-1}\\}$.

Constraints

* $1 \leq n, m \leq 200,000$
* $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$
* $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$

Input

The input is given in the following format.


$n$
$a_0 \; a_1 \; ... \; a_{n-1}$
$m$
$b_0 \; b_1 \; ... \; b_{m-1}$


Elements of $A$ and $B$ are given in ascending order respectively. There are no duplicate elements in each set.

Output

Print elements in the union in ascending order. Print an element in a line.

Example

Input

3
1 5 8
2
5 9


Output

1
5
8
9

Solution (in CPP):

Solution:
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <list>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>

using namespace std;

/* typedef */
typedef long long ll;

/* constant */
const int INF = 1 << 30;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;

/* global variables */

/* function */

/* main */
int main(){

    int n, m, x;
    set<int> odd, even;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x;
        odd.insert(x);
    }
    cin >> m;
    for (int i = 0; i < m; i++) {
        cin >> x;
        even.insert(x);
    }


    // 1 ==========================================
    vector<int> v1;
    set_union(odd.begin(), odd.end(),
                        even.begin(), even.end(),
                        inserter(v1, v1.end()));

    for (auto e: v1) {
        cout << e << '\n';
    }

    /*
    // 2 ==========================================
    set<int> s2;  // for 2
    set_union(odd.begin(), odd.end(),
          even.begin(), even.end(),
          inserter(s2, s2.begin()));

    for (auto const &e: s2) {
        cout << e << '\n';
    }

    // 3 ==========================================
    set<int> s3;  // for 3
    merge(odd.begin(), odd.end(),
        even.begin(), even.end(),
        inserter(s3, s3.begin()));

    for (auto const &e: s3) {
        cout << e << '\n';
    }
    */
}