/*Write a program to take two sorted arrays of size m and n as input. Merge both the arrays such
that the merged array is also sorted. Print the merged array.*/
#include <stdio.h>
 
int main() {
    int m, n;
    scanf("%d", &m);
    int a[m];
    for(int i = 0; i < m; i++)
        scanf("%d", &a[i]);
 
    scanf("%d", &n);
    int b[n];
    for(int i = 0; i < n; i++)
        scanf("%d", &b[i]);
 
    int merged[m+n];
    int i = 0, j = 0, k = 0;
 
    while (i < m && j < n) {
        if (a[i] < b[j])
            merged[k++] = a[i++];
        else
            merged[k++] = b[j++];
    }
 
    while (i < m)
        merged[k++] = a[i++];
 
    while (j < n)
        merged[k++] = b[j++];
 
    for (i = 0; i < m + n; i++)
        printf("%d ", merged[i]);
 
    return 0;
}
 

LypXcml0ZSBhIHByb2dyYW0gdG8gdGFrZSB0d28gc29ydGVkIGFycmF5cyBvZiBzaXplIG0gYW5kIG4gYXMgaW5wdXQuIE1lcmdlIGJvdGggdGhlIGFycmF5cyBzdWNoCnRoYXQgdGhlIG1lcmdlZCBhcnJheSBpcyBhbHNvIHNvcnRlZC4gUHJpbnQgdGhlIG1lcmdlZCBhcnJheS4qLwojaW5jbHVkZSA8c3RkaW8uaD4KCmludCBtYWluKCkgewogICAgaW50IG0sIG47CiAgICBzY2FuZigiJWQiLCAmbSk7CiAgICBpbnQgYVttXTsKICAgIGZvcihpbnQgaSA9IDA7IGkgPCBtOyBpKyspCiAgICAgICAgc2NhbmYoIiVkIiwgJmFbaV0pOwoKICAgIHNjYW5mKCIlZCIsICZuKTsKICAgIGludCBiW25dOwogICAgZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKICAgICAgICBzY2FuZigiJWQiLCAmYltpXSk7CgogICAgaW50IG1lcmdlZFttK25dOwogICAgaW50IGkgPSAwLCBqID0gMCwgayA9IDA7CgogICAgd2hpbGUgKGkgPCBtICYmIGogPCBuKSB7CiAgICAgICAgaWYgKGFbaV0gPCBiW2pdKQogICAgICAgICAgICBtZXJnZWRbaysrXSA9IGFbaSsrXTsKICAgICAgICBlbHNlCiAgICAgICAgICAgIG1lcmdlZFtrKytdID0gYltqKytdOwogICAgfQoKICAgIHdoaWxlIChpIDwgbSkKICAgICAgICBtZXJnZWRbaysrXSA9IGFbaSsrXTsKCiAgICB3aGlsZSAoaiA8IG4pCiAgICAgICAgbWVyZ2VkW2srK10gPSBiW2orK107CgogICAgZm9yIChpID0gMDsgaSA8IG0gKyBuOyBpKyspCiAgICAgICAgcHJpbnRmKCIlZCAiLCBtZXJnZWRbaV0pOwoKICAgIHJldHVybiAwOwp9Cg==

NAoxIDMgNSA3CjMKMiA0IDYKCg==

4
1 3 5 7
3
2 4 6