#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
	vector<int>v;
	int n,m,temp;
	cin>>n;
	for(int i=0;i<n;++i){
		cin>>temp;
		v.push_back(temp);
	}
	cin>>m;
	for(int i=0;i<m;++i){
		cin>>temp;
		v.push_back(temp);
	}
	sort(v.begin(),v.end());
	for(int i=0;i<n+m;++i){
		cout<<v[i]<<' ';
	}
	return 0;
}
/*
typedef struct node{
	int data;
	struct node *next;
}node,*Linknode;
void put(Linknode L){
	node *p=L->next;
	while(p->next!=NULL){
		cout<<p->data<<' ';
		p=p->next;
	}
	cout<<p->data<<endl;
}
void priorinsert(Linknode L,node *t,node *p){
	node *pre=L;
	while(pre->next!=p)
		pre=pre->next;
	t->next=pre->next;
	pre->next=t;
//	put(L);
}
void rearinsert(Linknode L,node *t,node *r){
	r=L;
	while(r->next!=NULL)
		r=r->next;
	t->next=r->next;
	r->next=t;
	r=t;
...