#include<bits/stdc++.h>
using namespace std;
using ll=long long;




int main(){

    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll N;
    cin>>N;
    vector<vector<ll>> PL(2001,vector<ll>(2001,0));
    for(int i=0;i<N;i++){
        ll x,y;
        cin>>x>>y;
        PL[x+y+1][x-y+1000]++;
    }
    for(int i=0;i<2000;i++){
        for(int j=0;j<2001;j++){
            PL[i+1][j]+=PL[i][j];
        }
    }
    for(int i=0;i<2001;i++){
        for(int j=0;j<2000;j++){
            PL[i][j+1]+=PL[i][j];
        }
    }

    ll M;
    cin>>M;
    ll an=1e18;
    for(int i=0;i<N;i++){
        ll x,y;
        cin>>x>>y;
        ll a=x+y+1;
        ll b=x-y+1000;
        if(PL[a][b]+PL[a-1][b-1]-PL[a][b-1]-PL[a-1][b]>0){
            cout<<0<<endl;
            return 0;
        }
        ll L=0,R=5000;
        while(R-L>1){
            ll mid=(R+L)/2;
            ll r=min(a+mid,ll(2000));
            ll d=min(b+mid,ll(2000));
            ll l=max(0ll,a-mid-1);
            ll u=max(0ll,b-mid-1);
            ll sm=PL[r][d]+PL[l][u]-PL[r][u]-PL[l][d];
            if(sm>0)R=mid;
            else L=mid;
        }
        // cout<<R<<endl;
        an=min(an,R);
    }
    cout<<an<<endl;
}