#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

struct RussianDoll
{	int h, r; RussianDoll(int h, int r) : h(h), r(r) { }};

bool operator < (RussianDoll left, RussianDoll right)
{	return left.h < right.h && left.r < right.r;	}

struct Edge
{	int from, to, cost;	Edge(int from, int to, int cost) : from(from), to(to), cost(cost) { } };

void input(vector<RussianDoll>& v, int n)
{
	rep(i, n)
	{
		int h, r;
		cin >> h >> r;
		v.push_back(RussianDoll(h, r));
	}
}

int Bellmanford(int n, const vector<Edge>& v)
{
	vint d(n, 0);
	
	bool update = true;
	while(update)
	{
		update = false;
		rep(i, v.size())
		{
			if(d[v[i].from] + v[i].cost < d[v[i].to])
			{
				d[v[i].to] = d[v[i].from] + v[i].cost;
				update = true;
			}
		}
	}
	
	return d[n - 1];
}

int main()
{
    int n;
	while(cin >> n && n)
	{
		vector<RussianDoll> v;
		vector<Edge> edges;
		
		input(v, n);
		
		cin >> n;
		input(v, n);
		
		n = v.size();
		
		rep(i, n) edges.push_back(Edge(0, i + 1, -1)), edges.push_back(Edge(i + 1, n + 1, 0));
		rep(i, n) rep(j, n) if(v[i] < v[j]) edges.push_back(Edge(i + 1, j + 1, -1));
			
		cout << -Bellmanford(n + 2, edges) << endl;
	}
}