#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=1005,INF=15<<26;

int dp1[MAX][MAX],dp2[MAX][MAX];

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    for(int i=0;i<MAX;i++) for(int j=0;j<MAX;j++){dp1[i][j]=-INF;dp2[i][j]=INF;}
    
    int N;cin>>N;
    vii A(N);
    for(int i=0;i<N;i++){
        cin>>A[i].fi>>A[i].se;
    }
    int M;cin>>M;
    vii B(M);
    for(int i=0;i<M;i++){
        int a,b;cin>>a>>b;
        dp1[a][b]=b;
        dp2[a][b]=b;
    }
    
    for(int a=0;a<MAX;a++){
        for(int b=0;b<MAX;b++){
            if(dp1[a][b]==b) continue;
            if(b) dp1[a][b]=dp1[a][b-1];
        }
        for(int b=MAX-1;b>=0;b--){
            if(dp2[a][b]==b) continue;
            if(b+1<MAX) dp2[a][b]=dp2[a][b+1];
        }
    }
    
    shuffle(all(A),rng);
    
    int ans=INF;
    
    for(auto [a,b]:A){
        for(int x=max(0,a-ans);x<=min(1000,a+ans);x++){
            if(dp1[x][b]!=-INF) chmin(ans,abs(a-x)+abs(b-dp1[x][b]));
            if(dp2[x][b]!=INF) chmin(ans,abs(a-x)+abs(b-dp2[x][b]));
        }
    }
    
    cout<<ans<<endl;
}