#include<iostream>
#include<algorithm>

using namespace std;

#define NwMAX 10
#define NbMAX 10
#define BLACK 0
#define WHITE 1

int main(){

	int Nw,Nb;
	int W[NwMAX],B[NbMAX];
	int ans=0;
	int h=0,wb=0;
	int i,j;
	int turn;

	cin>>Nw;
	for(int i=0;i<Nw;i++) cin>>W[i];
	cin>>Nb;
	for(int i=0;i<Nb;i++) cin>>B[i];

	sort(W,W+Nw);
	sort(B,B+Nb);

	cout<<W[0]<<endl;

	wb=W[Nw-1];
	h=1;
	i=Nw-2,j=Nb-1;
	turn=BLACK;
	while(1){
		if(turn==BLACK){
			if(j==-1) break;
			if(B[j]<wb){
				wb=B[j];
				turn=WHITE;
				h++;
			}
			j--;
		}
		else{
			if(i==-1) break;
			if(W[i]<wb){
				wb=W[i];
				turn=BLACK;
				h++;
			}
			i--;
		}
	}

	ans=h;

	wb=B[Nb-1];
	h=1;
	i=Nw-1,j=Nb-2;
	turn=WHITE;
	while(1){
		if(turn==BLACK){
			if(j==-1) break;
			if(B[j]<wb){
				wb=B[j];
				turn=WHITE;
				h++;
			}
			j--;
		}
		else{
			if(i==-1) break;
			if(W[i]<wb){
				wb=W[i];
				turn=BLACK;
				h++;
			}
			i--;
		}
	}

	if(ans<h) ans=h;
	cout<<ans<<endl;
}