#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 5;
struct state {
	int x, y, i;
};
bool cmp(state u, state v) {
	return u.x > v.x;
}
int n, m;
state a[N], b[N];
int seg[N << 2];
void update(int node, int s, int e, int i, int val) {
	if(s == e) {
		seg[node] = min(seg[node], val);
		return;
	}
	int mid = s + e >> 1;
	if(i <= mid)
		update(node << 1, s, mid, i, val);
	else
		update(node << 1 | 1, mid + 1, e, i, val);
	seg[node] = min(seg[node << 1], seg[node << 1 | 1]);
}
int query(int node, int s, int e, int l, int r) {
	if(s > r || e < l)
		return 1e9;
	if(l <= s && e <= r)
		return seg[node];
	int mid = s + e >> 1;
	return min(query(node << 1, s, mid, l, r), query(node << 1 | 1, mid + 1, e, l, r));
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 0;i < n;i++) {
		cin >> a[i].x >> a[i].y;
		a[i].i = i + 1;
	}
	cin >> m;
	for(int i = 0;i < m;i++) {
		cin >> b[i].x >> b[i].y;
		b[i].i = i;
	}
	sort(a, a + n, cmp);
	sort(b, b + m, cmp);
	fill(seg, seg + (N << 2), 1e9);
	ll ans = 0;
	for(int i = 0, j = 0;i < m;i++) {
		while(j < n && a[j].x >= b[i].x) {
			update(1, 1, 1e5, a[j].y, a[j].i);
			j++;
		}
		ans += query(1, 1, 1e5, 1, b[i].y);
	}
	cout << ans;
    return 0;
}