#include <bits/stdc++.h>
#include <numeric>

using namespace std;

long maximumPeople(vector <long> p, vector <long> x, vector <long> y, vector <long> r) {
    int m=y.size();
    if(m==1)
    {
        return accumulate(p.begin(),p.end(),0);
    }
    int count=0;
    sort(p.begin(),p.end());
    sort(x.begin(),x.end(),greater<int>());
    count=0;
    for(int i=0;i<m;i++)//no of clouds
    {
        int from=y[i]-r[i];
        int to=y[i]+r[i];
        
        if(x[i]>=from || x[i]<=to)
        {
            count++;
            if(count>1)
            {
                break;
            }
        }
    }//one town is processed
    if(count==1)
    {
        return 0;
    }
    return count;
}

int main() {
    int n;
    cin >> n;
    vector<long> p(n);
    for(int p_i = 0; p_i < n; p_i++){
       cin >> p[p_i];
    }
    vector<long> x(n);
    for(int x_i = 0; x_i < n; x_i++){
       cin >> x[x_i];
    }
    int m;
    cin >> m;
    vector<long> y(m);
    for(int y_i = 0; y_i < m; y_i++){
       cin >> y[y_i];
    }
    vector<long> r(m);
    for(int r_i = 0; r_i < m; r_i++){
       cin >> r[r_i];
    }
    long result = maximumPeople(p, x, y, r);
    cout << result << endl;
    return 0;
}