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

#define rep(i, a, b) for (auto i = a; i < (b); ++i)
#define repr(i, a, b) for (auto i = (a) - 1; i >= (b); --i)
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;

template<class T>
inline bool cmax(T &a, const T& b) {
    return a < b ? a = b, 1 : 0;
}

template<class T>
inline bool cmin(T &a, const T &b) {
    return b < a ? a = b, 1 : 0;
}

const int inf = 0x3f3f3f3f;
const ll linf = 1e18;
const double dinf = numeric_limits<double>::infinity();

struct SegmentTree {
    typedef int T;
    static constexpr T unit = INT_MIN;
    T f(T a, T b) { return max(a, b); }
    vector<T> s; int n;
    SegmentTree(int n = 0, T def = unit) : s(2*n, def), n(n) {}
    void update(int pos, T val) {
        for (s[pos += n] = val; pos /= 2; )
            s[pos] = f(s[pos*2], s[pos*2+1]);
    }
    T get(int b, int e) {
        T ra = unit, rb = unit;
        for (b += n, e+= n; b < e; b /= 2, e/= 2) {
            if (b%2) ra = f(ra, s[b++]);
            if (e%2) rb = f(s[--e], rb);
        }
        return f(ra, rb);
    }
};

/*struct SegmentTree {
    vi t;
    int n;

    SegmentTree(int n) {
        t = vi(4*n, INT_MIN);
    }

    void update(int v, int tl, int tr, int pos, int x) {
        if ()
    }

    int get(int v, int tl, int tr, int l, int r) {

    }
};*/

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int s;
    cin >> s;
    vpii ab(s);
    map<int, vpii> a;
    for (int i = 0; i< s; i++) {
        cin >> ab[i].first >> ab[i].second;
        a[ab[i].second].pb({ab[i].first, i});
    }
    int c;
    cin >> c;
    vpii coins(c);
    for (int i = 0; i< c; i++) {
        cin >> coins[i].second >> coins[i].first; // Its swapped Importnant
    }

    sort(all(coins));

    SegmentTree tree(s); // MAx tree
    int res = 0;
    int prev = 0;
    for (int i = 0; i < c; i++) {
        for (int j = prev; j <= coins[i].first; j++) {
            for (auto x : a[j]) {
                tree.update(x.second, x.first);
            }
        }
        prev = coins[i].first+1;

        int lo = 0, hi = s-1, ans = s-1, mid;
        while (lo <= hi) {
            mid = (lo+hi)/2;

            bool check = tree.get(0, mid+1) >= coins[i].second;
            if (check) {
                ans = mid;
                hi = mid - 1;
            } else
                lo = mid + 1;
        }
        
        res += ans+1;
    }

    cout << res << endl;

    return 0;
}