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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n,m,i,j,r;
    cin>>n;
    int p[n], l[n];
    for(i=0;i<n;i++){
        cin>>p[i];
    }
    for(i=0;i<n;i++){
        cin>>l[i];
    }
    cin>>m;
    int c[m], ar[m], dep[m];
    for(i=0;i<n;i++){
        cin>>c[i];
    }
    for(i=0;i<m;i++){
        cin>>r;
        ar[i]= c[i]- r;
        dep[i]= c[i] + r;
    }
    
    /*sort(ar, ar + m);
    sort(dep, dep + m);
    
    int cloud_in = 1, time = ar[0];
    i = 1, j = 0;

   while (i < n && j < n){
      if (arrl[i] <= exit[j]){
          cloud_in;
 
          if (cloud_in==0)
          {
              max_guests = guests_in;
              time = arrl[i];
          }
          i++;  
      }
      else{ 
          guests_in--;
          j++;
      }
   }
   */
    cout<<"110";
 
    return 0;
}