#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

template <typename T>
struct BinaryIndexedTree2D {
  int H, W;
  vector<vector<T>> bit;
  BinaryIndexedTree2D(int _H, int _W) : H(_H + 1), W(_W + 1) {
    bit.resize(H + 3, vector<T>(W + 3, 0));
  }
  // 関数の入力のindexは0-originを想定

  // (x,y)にwを足す
  // 範囲外の時は足さない
  void add(int x, int y, T w) {
    if (x < 0 || x >= H || y < 0 || y >= W) return;
    for (int a = (++y, ++x); a <= H; a += a & -a) {
      for (int b = y; b <= W; b += b & -b) {
        bit[a][b] += w;
      }
    }
  }

  // imos法で[(x1,y1) , (x2,y2)]にwを足す
  void imos(int x1, int y1, int x2, int y2, T w) {
    add(x1, y1, w);
    add(x1, y2 + 1, -w);
    add(x2 + 1, y1, -w);
    add(x2 + 1, y2 + 1, w);
  }

  //  [(0,0) , (x,y)]の和　閉区間に注意！
  // x,y<0の時は0 x>=H y>=Wのときはx=H-1,y=W-1とみなす
  // ( imos法の時は (x,y)の値を返す )
  T sum(int x, int y) {
    if (x < 0 || y < 0) return 0;
    if (x >= H) x = H - 1;
    if (y >= W) y = W - 1;
    T ret = 0;
    for (int a = (++y, ++x); a > 0; a -= a & -a) {
      for (int b = y; b > 0; b -= b & -b) {
        ret += bit[a][b];
      }
    }
    return ret;
  }

  // [(x1,y1) , (x2,y2)] の和
  // x1 > x2, y1 > y2の時はswap
  T sum(int x1, int y1, int x2, int y2) {
    if (x1 > x2 || y1 > y2) return T(0);
    return sum(x2, y2) - sum(x2, y1 - 1) - sum(x1 - 1, y2) +
           sum(x1 - 1, y1 - 1);
  }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int n;
    cin >> n;
    vector<int> x(n), y(n);
    rep(i, n) {
        int a, b;
        cin >> a >> b;
        x[i] = a - b + 1000;
        y[i] = a + b + 1;
    }
    vector<vector<int>> sum(2000, vector(2000, 0));
    int m;
    cin >> m;
    rep(i, m) {
        int a, b;
        cin >> a >> b;
        int X = a - b + 1000;
        int Y = a + b + 1;
        sum[X][Y] ++;
    }
    rep(i, 1999) rep(j, 2000) sum[i + 1][j] += sum[i][j];
    rep(i, 2000) rep(j, 1999) sum[i][j + 1] += sum[i][j];
    int le = -1, ri = 5000;
    auto s = [&](int x1, int x2, int y1, int y2) -> int {
        x1 = max(x1, 0);
        x2 = min(x2, 1999);
        y1 = max(y1, 0);
        y2 = min(y2, 1999);
        return sum[x2][y2] - sum[x2][y1] - sum[x1][y2] + sum[x1][y1];
    };
    while(ri - le > 1) {
        int mid = (ri + le) / 2;
        bool f = 0;
        rep(i, n) if(s(x[i] - mid - 1, x[i] + mid, y[i] - mid - 1, y[i] + mid)) f = 1;
        if(f) ri = mid;
        else le = mid;
    }
    cout << ri << endl;
    return 0;
}