#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

const int MAX = 200001;
const int INF = 0x7fffffff;

int s1[MAX];
int s2[MAX];

int main(){
    int len1, len2;
    scanf("%d", &len1);
    for(int i=0; i<len1; i++)
        scanf("%d", &s1[i]);
    scanf("%d", &len2);
    for(int i=0; i<len2; i++)
        scanf("%d", &s2[i]);
    //避免长度不一致而产生越界的为问题，是一个很巧妙的方法
    s1[len1] = s2[len2] = INF;
    int count = 0, mid = (len1 + len2 - 1)/2;
    int i = 0, j = 0;
    while(count < mid){
        if(s1[i] < s2[j]){
            i++;
        }
        else{
            j++;
        }
        count++;
    }
    if(s1[i] < s2[j])
        printf("%d\n", s1[i]);
    else
        printf("%d\n", s2[j]);
    return 0;
}