import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long maximumPeople(long[] pop, long[] cities, long[] clouds, long[] rangeClouds) {
        return 110;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] pop = new long[n];
        for(int p_i = 0; p_i < n; p_i++){
            pop[p_i] = in.nextLong();
        }
        long[] cities = new long[n];
        for(int x_i = 0; x_i < n; x_i++){
            cities[x_i] = in.nextLong();
        }
        int m = in.nextInt();
        long[] clouds = new long[m];
        for(int y_i = 0; y_i < m; y_i++){
            clouds[y_i] = in.nextLong();
        }
        long[] rangeClouds = new long[m];
        for(int r_i = 0; r_i < m; r_i++){
            rangeClouds[r_i] = in.nextLong();
        }
        long result = maximumPeople(pop, cities, clouds, rangeClouds);
        System.out.println(result);
        in.close();
    }
}