#include using namespace std; typedef long long ll; typedef pair pll; typedef pair pii; typedef pair pdd; typedef vector vi; typedef vector vll; typedef vector vd; typedef vector vs; typedef vector vvi; typedef vector vvvi; typedef vector vvll; typedef vector vvvll; typedef vector vpii; typedef vector vvpii; typedef vector vpll; typedef vector vvpll; typedef vector vpdd; typedef vector vvd; #define yn(ans) printf("%s\n", (ans)?"Yes":"No"); #define YN(ans) printf("%s\n", (ans)?"YES":"NO"); template bool chmax(T &a, T b) { if (a >= b) return false; a = b; return true; } template bool chmin(T &a, T b) { if (a <= b) return false; a = b; return true; } #define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t)) #define REP(i, e) for (int i = 0; i < (e); ++i) #define REP1(i, s, e) for (int i = (s); i < (e); ++i) #define RREP(i, e) for (int i = (e); i >= 0; --i) #define RREP1(i, e, s) for (int i = (e); i >= (s); --i) #define all(v) v.begin(), v.end() #define pb push_back #define qb pop_back #define pf push_front #define qf pop_front #define maxe max_element #define mine min_element ll inf = 1e18; #define DEBUG printf("%d\n", __LINE__); fflush(stdout); template void print(vector &v, bool withSize = false) { if (withSize) cout << v.size() << endl; REP(i, v.size()) cout << v[i] << " "; cout << endl; } mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count()); int __FAST_IO__ = []() { std::ios::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0); return 0; }(); #define TESTS int t; cin >> t; while (t--) #define TEST int main() { int N, M; cin >> N; vpii A(N); REP(i, N) cin >> A[i].first >> A[i].second; cin >> M; vpii B(M); REP(i, M) cin >> B[i].first >> B[i].second; int mx = 1000; vvi mxpxpy(mx, vi(mx, -1e9)); vvi mxpxny(mx, vi(mx, -1e9)); vvi mnpxpy(mx, vi(mx, 1e9)); vvi mnpxny(mx, vi(mx, 1e9)); REP(i, N) { int x = A[i].first, y = A[i].second; mxpxpy[x][y] = mnpxpy[x][y] = x + y; mxpxny[x][y] = mnpxny[x][y] = x - y; } REP(i, mx) { REP(j, mx) { if (i > 0) chmax(mxpxpy[i][j], mxpxpy[i - 1][j]); if (j > 0) chmax(mxpxpy[i][j], mxpxpy[i][j - 1]); } } RREP(i, mx - 1) { REP(j, mx - 1) { if (i < mx - 1) chmin(mxpxpy[i][j], mnpxpy[i + 1][j]); if (j < mx - 1) chmin(mxpxpy[i][j], mnpxpy[i][j + 1]); } } RREP(i, mx - 1) { REP(j, mx) { if (i < mx - 1) chmin(mnpxny[i][j], mnpxny[i + 1][j]); if (j > 0) chmin(mnpxny[i][j], mnpxny[i][j - 1]); } } REP(i, mx) { RREP(j, mx - 1) { if (i > 0) chmax(mxpxny[i][j], mxpxny[i - 1][j]); if (j < mx - 1) chmax(mxpxny[i][j], mxpxny[i][j + 1]); } } int ans = 1e9; REP(i, M) { int x = B[i].first, y = B[i].second; chmin(ans, x + y - mxpxpy[x][y]); chmin(ans, mnpxpy[x][y] - (x + y)); chmin(ans, x - y - mxpxny[x][y]); chmin(ans, mnpxny[x][y] - (x - y)); } printf("%d\n", ans); return 0; }