MEPhI govn

#include <fstream>
#include <iostream>
#include <deque>
#include <cstdlib>
#include <algorithm>

using namespace std;

 int main(){
     int A[30],B[30];
     for(int i=0;i<30;i++){
         cin>>A[i];
     }
     for(int i=0;i<30;i++){
         cin>>B[i];
     }
     sort(&A[0],&A[29]);
     sort(&B[0],&B[29]);
     int* it = find (B,B+30,A[0]);
     int i=0;
     while(it!=B+30){
         i++;
         it = find (B,B+30,A[i]);
     }
     cout<<A[i];
}