using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var nmap = NArr(n);
        var m = NN;
        var mmap = NArr(m);
        WriteLine(Dist(n, nmap, m, mmap));
    }
    static int Dist(int n, int[][] nmap, int m, int[][] mmap)
    {
        Array.Sort(nmap, (l, r) =>
        {
            var d = l[0].CompareTo(r[0]);
            if (d != 0) return d;
            return l[1].CompareTo(r[1]);
        });
        Array.Sort(mmap, (l, r) =>
        {
            var d = l[0].CompareTo(r[0]);
            if (d != 0) return d;
            return l[1].CompareTo(r[1]);
        });
        var w = 1000;
        var mdic = new List<int>[w];
        for (var i = 0; i < mdic.Length; ++i) mdic[i] = new List<int>();
        for (var i = m - 1; i >= 0; --i)
        {
            var t = mmap[i];
            mdic[t[1]].Add(t[0]);
        }
        var lt = Enumerable.Repeat(INF, w).ToArray();
        var rt = (int[]) lt.Clone();
        var lb = (int[]) lt.Clone();
        var rb = (int[]) lt.Clone();
        for (var i = m - 1; i >= 0; --i)
        {
            lt[mmap[i][1]] = Math.Min(lt[mmap[i][1]], mmap[i][0] + w - mmap[i][1]);
            rt[mmap[i][1]] = Math.Min(rt[mmap[i][1]], mmap[i][0] + mmap[i][1]);
        }
        var ans = INF;
        var npos = 0;
        for (var i = 0; i < w; ++i)
        {
            var ltmin = new int[w];
            ltmin[0] = lt[0];
            for (var j = 1; j < w; ++j) ltmin[j] = Math.Min(ltmin[j - 1], lt[j]);
            var rtmin = new int[w];
            rtmin[^1] = rt[^1];
            for (var j = w - 2; j >= 0; --j) rtmin[j] = Math.Min(rtmin[j + 1], rt[j]);
            var lbmin = new int[w];
            lbmin[0] = lb[0];
            for (var j = 1; j < w; ++j) lbmin[j] = Math.Min(lbmin[j - 1], lb[j]);
            var rbmin = new int[w];
            rbmin[^1] = rb[^1];
            for (var j = w - 2; j >= 0; --j) rbmin[j] = Math.Min(rbmin[j + 1], rb[j]);
            for (var j = 0; j < w; ++j)
            {
                if (npos < n && nmap[npos][0] == i && nmap[npos][1] == j)
                {
                    ans = Math.Min(ans, ltmin[nmap[npos][1]] - w + nmap[npos][1]);
                    ans = Math.Min(ans, rtmin[nmap[npos][1]] - nmap[npos][1]);
                    ans = Math.Min(ans, lbmin[nmap[npos][1]] - w + nmap[npos][1]);
                    ans = Math.Min(ans, rbmin[nmap[npos][1]] - nmap[npos][1]);
                    ++npos;
                }
            }
            for (var j = 0; j < w; ++j)
            {
                if (mdic[j].Count > 0 && mdic[j][^1] == i)
                {
                    lb[j] = lt[j];
                    rb[j] = rt[j];
                    if (mdic[j].Count == 1)
                    {
                        lt[j] = INF;
                        rt[j] = INF;
                    }
                    else
                    {
                        lt[j] += mdic[j][^2] - mdic[j][^1];
                        rt[j] += mdic[j][^2] - mdic[j][^1];
                    }
                    mdic[j].RemoveAt(mdic[j].Count - 1);
                }
            }
            for (var j = 0; j < w; ++j)
            {
                --lt[j];
                --rt[j];
                ++lb[j];
                ++rb[j];
            }
        }
        return ans;
    }
    static int INF = int.MaxValue / 3;
    struct SegOp : ILazySegTreeOperator<int, int>
    {
        public int Op(int a, int b)
        {
            return Math.Min(a, b);
        }
        public int E()
        {
            return INF;
        }
        public int Mapping(int f, int x)
        {
            return f + x;
        }
        public int Id()
        {
            return 0;
        }
        public int Composition(int f, int g)
        {
            return f + g;
        }
    }
    interface ILazySegTreeOperator<S, F>
    {
        /// <summary>集合S上の二項演算 S×S → S</summary>
        S Op(S a, S b);
        /// <summary>Sの単位元</summary>
        S E();
        /// <summary>写像f(x)</summary>
        S Mapping(F f, S x);
        /// <summary>写像の合成 f ○ g</summary>
        F Composition(F f, F g);
        /// <summary>恒等写像 id</summary>
        F Id();
    }
    // モノイドの型 S
    // 写像の型 F
    // 以下の関数を格納する T
    //   ・: S × S → S を計算する関数 S op(S a, S b)
    //   e を返す関数 S e()
    //   f(x) を返す関数 S mapping(F f, S x)
    //   f○gを返す関数 F composition(F f, F g)
    //   idを返す関数 F id()
    // S,Fはreadonlyにしておくと速い
    // Tの関数オーバーフローに注意
    class LazySegTree<S, F>
    {
        int _n;
        int size;
        int log;
        List<S> d;
        List<F> lz;
        ILazySegTreeOperator<S, F> op;
        public LazySegTree(int n, ILazySegTreeOperator<S, F> op)
        {
            _n = n;
            var v = new S[n];
            for (var i = 0; i < v.Length; ++i) v[i] = op.E();
            Init(v, op);
        }
        public LazySegTree(S[] v, ILazySegTreeOperator<S, F> op)
        {
            _n = v.Length;
            Init(v, op);
        }
        private void Init(S[] v, ILazySegTreeOperator<S, F> op)
        {
            size = 1;
            log = 0;
            this.op = op;
            while (size < v.Length)
            {
                size <<= 1;
                ++log;
            }
            d = Enumerable.Repeat(op.E(), size * 2).ToList();
            lz = Enumerable.Repeat(op. Id(), size).ToList();
            for (var i = 0; i < v.Length; ++i) d[size + i] = v[i];
            for (var i = size - 1; i >= 1; --i) Update(i);
        }

        /// <summary>一点更新</summary>
        public void Set(int pos, S x)
        {
            pos += size;
            for (var i = log; i >= 1; --i) Push(pos >> i);
            d[pos] = x;
            for (var i = 1; i <= log; ++i) Update(pos >> i);
        }

        /// <summary>一点取得</summary>
        public S Get(int pos)
        {
            pos += size;
            for (var i = log; i >= 1; --i) Push(pos >> i);
            return d[pos];
        }

        /// <summary>区間取得 op(a[l..r-1])</summary>
        public S Prod(int l, int r)
        {
            if (l == r) return op.E();
            l += size;
            r += size;
            for (var i = log; i >= 1; --i)
            {
                if (((l >> i) << i) != l) Push(l >> i);
                if (((r >> i) << i) != r) Push(r >> i);
            }
            S sml = op.E();
            S smr = op.E();
            while (l < r)
            {
                if ((l & 1) != 0) sml = op.Op(sml, d[l++]);
                if ((r & 1) != 0) smr = op.Op(d[--r], smr);
                l >>= 1;
                r >>= 1;
            }

            return op.Op(sml, smr);
        }

        /// <summary>全体取得 op(a[0..n-1])</summary>
        public S AllProd() => d[1];

        /// <summary>なにこれ a[p] = op_st(a[p], x)</summary>
        public void Apply(int pos, F f)
        {
            pos += size;
            for (var i = log; i >= 1; --i) Push(pos >> i);
            d[pos] = op.Mapping(f, d[pos]);
            for (var i = 1; i <= log; ++i) Update(pos >> i);
        }

        /// <summary>区間更新 i = l..r-1 について a[i] = op_st(a[i], x)</summary>
        public void Apply(int l, int r, F f)
        {
            if (l == r) return;
            l += size;
            r += size;

            for (var i = log; i >= 1; --i)
            {
                if (((l >> i) << i) != l) Push(l >> i);
                if (((r >> i) << i) != r) Push((r - 1) >> i);
            }
            {
                var l2 = l;
                var r2 = r;
                while (l < r)
                {
                    if ((l & 1) != 0) AllApply(l++, f);
                    if ((r & 1) != 0) AllApply(--r, f);
                    l >>= 1;
                    r >>= 1;
                }
                l = l2;
                r = r2;
            }
            for (var i = 1; i <= log; ++i)
            {
                if (((l >> i) << i) != l) Update(l >> i);
                if (((r >> i) << i) != r) Update((r - 1) >> i);
            }
        }

        /// <summary>segtreeの上で二分探索をする
        /// Sを引数にとりboolを返す関数gが必要
        /// fが単調であれば、g(op(a[l], a[l + 1], ... a[r - 1])) = true となる最大のrが取得される
        /// 制約
        /// ・fに副作用がない
        /// ・f(op.E()) = true
        /// </summary>
        public int MaxRight(int l, Predicate<S> g)
        {
            if (l == _n) return _n;
            l += size;
            for (var i = log; i >= 1; --i) Push(l >> i);
            S sm = op.E();
            do
            {
                while (l % 2 == 0) l >>= 1;
                if (!g(op.Op(sm, d[l])))
                {
                    while (l < size)
                    {
                        Push(l);
                        if (g(op.Op(sm, d[l])))
                        {
                            sm = op.Op(sm, d[l]);
                            ++l;
                        }
                    }
                    return l - size;
                }
                sm = op.Op(sm, d[l]);
                ++l;
            } while ((l & -l) != l);
            return _n;
        }

        /// <summary>segtreeの上で二分探索をする
        /// Sを引数にとりboolを返す関数gが必要
        /// fが単調であれば、g(op(a[l], a[l + 1], ..., a[r - 1])) = true となる最小のlが取得される
        /// 制約
        /// ・fに副作用がない
        /// f(op.E()) = true
        public int MinLeft(int r, Predicate<S> g)
        {
            if (r == 0) return 0;
            r += size;
            for (var i = log; i >= 1; --i) Push((r - 1) >> i);
            S sm = op.E();
            do
            {
                --r;
                while (r > 1 && r % 2 == 1) r >>= 1;
                if (!g(op.Op(d[r], sm)))
                {
                    while (r < size)
                    {
                        Push(r);
                        r = (2 * r + 1);
                        if (g(op.Op(d[r], sm)))
                        {
                            sm = op.Op(d[r], sm);
                            --r;
                        }
                    }
                    return r + 1 - size;
                }
                sm = op.Op(d[r], sm);
            } while ((r & -r) != r);
            return 0;
        }

        void Update(int k)
        {
            d[k] = op.Op(d[2 * k], d[2 * k + 1]);
        }
        void AllApply(int k, F f)
        {
            d[k] = op.Mapping(f, d[k]);
            if (k < size) lz[k] = op.Composition(f, lz[k]);
        }
        void Push(int k)
        {
            AllApply(2 * k, lz[k]);
            AllApply(2 * k + 1, lz[k]);
            lz[k] = op.Id();
        }
    }
}