九度oj1004

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>


int main()
{ 
	 int s1[100000];
	 int s2[100000];
	 int result;

	 int n1,n2;
	 int i,j,med,cn;
	int find;

	while(scanf("%d",&n1) != EOF)
	{
		for(i=0;i<n1;i++)
			scanf("%d",&s1[i]);

		scanf("%d",&n2);

		for(j=0;j<n2;j++)
			scanf("%d",&s2[j]);

		med = n1+n2;
		if(med %2 == 0)
			med = med/2;
		else
			med = med/2+1;

		i = j = 0;
		find = 0;
		cn = 0;

		while(i< n1 && j < n2)
		{
			if(s1[i] <= s2[j])
			{
				cn++;
		
				if(cn == med)
				{
					find = 1;
					result = s1[i];
					break;
				}
				i++;
			}
			else
			{
				cn++;
			
				if(cn == med)
				{
					find = 1;
					result = s2[j];
					break;
				}
				j++;
			}
		}

		while(find == 0 && i < n1 && j >= n2)
		{
			cn++;
			if(cn == med)
			{
				find = 1;
				result = s1[i];
				break;
			}
			i++;
		}

		while(find == 0 && i >= n1 && j < n2)
		{
			cn++;
			if(cn == med)
			{
				find = 1;
				result = s2[j];
				break;
			}
			j++;
		}

		printf("%d\n",result);
	}



	return 0;

}