#include<iostream>
using namespace std;

class node {
  public :
    int data;
    node * next;
    node(int data){
        this-> data = data;
        next = NULL;
    }


};

void insertHead(node* &head, int data){
    node * n = new node(data);
    n -> next = head;
    head = n;
}

void insert(node * &head, int data){
    node * n = new node(data);
    node * temp = head;
    while(temp -> next != NULL){
        temp = temp -> next;
    }
    temp->next = n;
    n -> next = NULL;

}

void print(node * &head){

    node * temp = head;
    while(temp != NULL){
        cout<<temp->data<<" ";
        temp = temp -> next;
    }

}

void reverseK(node* &head, int k){
     node * temp = head, *curr = head;
     node *tempPointer = NULL;
     node *prev = NULL;
     node * null_node = NULL;
     int count = 0, flag = 0;
     while(temp != NULL){
         prev = NULL;
         count = 0;

         while(temp != NULL){
             temp = curr->next;
             curr->next= prev;
             prev = curr;
             curr = temp;
             count++;
             if(count == 1){
                 tempPointer = prev;
             }
             if(count == k){
                 flag++;
                 break;
                 count = 0;
             }
            // cout<<flag<<endl;

         }

         if(flag == 1){
            null_node = head;
            head =  prev;
            // print(head);
            // cout<<endl;
            //cout<<"**"<<endl;
         }
         else{
             null_node->next = prev;
             null_node = tempPointer;
            //   print(head);
            // cout<<endl;
         }


     }



}

int intersect(node *head, node* Head){
    if(head == NULL || Head == NULL)
        return 0;

    node * c1 =NULL, *c2 = NULL;
    c1 = head;
    c2 = Head;
    int flag = 0;
    while(c1 != NULL){
       // cout<<"Hello"<<endl;
        while(c2 != NULL){
            if(c1->next == c2->next)
            {
                return c1->data;
            }
            c2 = c2->next;
        }

        c1 = c1->next;
    }
    return 0;
}

int main(){
    int n;
    cin>>n;

   node *head = NULL, *Head = NULL;
   int i = 0;
   for(int i = 0; i < n; i++){
       int a;
       cin>>a;
        if(i == 0)
            insertHead(head, a);
        else
            insert(head, a);
   }
   cin>>n;
   for(int i = 0; i < n; i++){
       int a;
       cin>>a;
        if(i == 0)
            insertHead(Head, a);
        else
            insert(Head, a);
   }
   int data = intersect(head, Head);
   cout<<data;
   // print(head1);
       return 0;

}