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

Price labels

Price labels

The company "Black Label" has received two orders for manufacturing the supermarket price labels. For each order the number of labels and prices that should be printed are given. Print all the prices for which the labels would be manufactured after the performance of these two orders. Each price must be printed only once.

Input

The first line contains the number n of price tags for the first supermarket. The second line contains the list of n price labels to be manufactured for the first supermarket. The third line contains the number m of price tags for the second supermarket. The fourth line contains the list of m price tags for the second supermarket. All given numbers are integers and do not exceed 109.

Output

Output the values that will be printed on the price labels - each price print only once. The price labels must be printed in ascending order.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
100 25 300 400 12000
4
10 25 25 500
Output example #1
10 25 100 300 400 500 12000