#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    freopen("castles.in", "r", stdin);
    freopen ("castles.out", "w", stdout);
    int n;
    cin>>n;
    vector <int> x(n);
    vector <int> y(n);
    for (int i=0; i<n; i++){
        cin>>x[i]>>y[i];
    }
    int h, v;
    cin>>h>>v;
    vector <int> hor(h+2);
    vector <int> vert(v+2);
    for (int i=0; i<h; i++){
        cin>>hor[i];
    }
    hor[h]=1000000001;
    hor[h+1]=-1000000001;
    for (int i=0; i<v; i++){
        cin>>vert[i];
    }
    vert[v]=1000000001;
    vert[v+1]=-1000000001;
    sort(hor.begin(), hor.end());
    sort(vert.begin(), vert.end());
    int answer=0;
    for (int i=0; i<h+1; i++){
        for (int j=0; j<v+1; j++){
            int l=0;
            for (int k=0; k<n; k++){
                if (x[k]>vert[j] && x[k]<vert[j+1] && y[k]>hor[i] && y[k]<hor[i+1]){
                    l++;
                }
            }
            if (l>answer){
                answer=l;
            }
        }
    }
    cout<<answer<<"\n";
}