import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

void main(){
    while(true) {
        auto n = readInt();
        if(n == 0) {
            return;
        }
        bool[Tuple!(int, int)] set;
        foreach(i; iota(n)) {
            int h, r;
            readlnTo(h, r);
            set[tuple(h,r)] = true;
        }
        auto m = readInt();
        foreach(i; iota(m)) {
            int h, r;
            readlnTo(h, r);
            set[tuple(h,r)] = true;
        }
        auto dp = new int[][](1000, 1000);
        foreach(i; iota(1, 1000)) {
            foreach(j; iota(1, 1000)) {
                if(tuple(i, j) in set) {
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1], dp[i-1][j-1] + 1);
                } else {
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                }
            }
        }
        writeln(dp[$-1][$-1]);
    }
}