e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Merge the sequences

Merge the sequences

Two sorted sequences are given. Merge them.

Input

First line contains the length of the first sequence n (n106), followed by n sorted integers.

Second line contains the length of the second sequence m (m106), followed by m sorted integers.

Output

Merge two given sequences and print the result in one line.

Time limit 1 second
Memory limit 128 MiB
Input example #1
4 2 4 6 7
6 1 2 2 4 5 6
Output example #1
1 2 2 2 4 4 5 6 6 7 
Author Michael Medvedev