#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int n;
    cin >> n;
    vi x(n), y(n);
    FOR(n) cin >> x[i] >> y[i];
    int m;
    cin >> m;
    vi z(m), w(m);
    const int MAXN = 1000;
    vvi ids(MAXN);
    FOR(m) {
        cin >> z[i] >> w[i];
        ids[z[i]].emplace_back(i);
    }
    FOR(MAXN) sort(all(ids[i]), [&](int i, int j) -> bool { return w[i] < w[j]; });
    vi sz(MAXN);
    FOR(MAXN) sz[i] = (int)ids[i].size();

    vector<int> order(n);
    iota(all(order), 0);
    sort(all(order), [&](int i, int j) -> bool { return y[i] < y[j]; });

    int ans = INF;
    vi cur_ids(MAXN, 0);
    for(int i : order) {
        rep(j, MAXN) {
            while(cur_ids[j]+1 < sz[j] && w[ids[j][cur_ids[j]+1]] < y[i]) ++cur_ids[j];
            if(cur_ids[j] < sz[j]) {
                // cerr << i << " " << j << " " << ids[j][cur_ids[j]] << endl;
                chmin(ans, abs(x[i]-j) + abs(y[i]-w[ids[j][cur_ids[j]]]));
            }
            if(cur_ids[j]+1 < sz[j]) {
                // cerr << i << " " << j << " " << ids[j][cur_ids[j]+1] << endl;
                chmin(ans, abs(x[i]-j) + abs(w[ids[j][cur_ids[j]+1]]-y[i]));
            }
        }
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}