Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"sort"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		hr := make([]entry, 0)
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			first, _ := strconv.Atoi(buf[0])
			second, _ := strconv.Atoi(buf[1])
			mt := entry{first, second}
			hr = append(hr, mt)
		}
		scanner.Scan()
		m, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			first, _ := strconv.Atoi(buf[0])
			second, _ := strconv.Atoi(buf[1])
			mt := entry{first, second}
			hr = append(hr, mt)
		}
		sort.Sort(ByFirst(hr))
		fmt.Println(LIS(hr))
	}
}

type entry struct {
	first, second int
}

type ByFirst []entry

func(f ByFirst) Len() int {
	return len(f)
}

func (f ByFirst) Swap(i, j int) {
	f[i], f[j] = f[j], f[i]
}

func (f ByFirst) Less(i, j int) bool {
	return f[i].first < f[j].first
}

func LIS(hr []entry) int {
	n := len(hr)
	lis := make([]int, n)
	lis[n-1] = 1
	for i := n-2; i > -1; i-- {
		m := 0
		for j := i+1; j < n; j++ {
			if hr[i].first < hr[j].first && hr[i].second < hr[j].second && lis[j] > m {
				m = lis[j]
			}
		}
		lis[i] = m+1
	}
	return lis[0]
}

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

#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)

#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.first)
#define cdr(a) (a.second)
#define cadr(a) (car(cdr(a)))
#define cddr(a) (cdr(cdr(a)))
#define all(a) a.begin(), a.end()
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;

typedef long long Integer;
typedef double Real;
typedef vector<int> vi;
typedef vector<string> vs;
typedef map<string,int> Dictionary;
const Real PI = acos(-1);

template<class S, class T>
ostream& operator<<(ostream& os, pair<S,T> p) {
  os << '(' << car(p) << ", " << cdr(p) << ')';
  return os;
}

template<class T>
ostream& operator<<(ostream& os, vector<T> v) {
  if (v.size() == 0) {
    os << "(empty)";
    return os;
  }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

int dx[] = { -1, 0, 1, 0 };
int dy[] = {  0, -1, 0, 1 };

int main() {

more:

  vector<int> hs;
  vector<int> rs;

  {
    int n; cin >> n;
    if (!n) return 0;
    rep (_, n) {
      int h, r; cin >> h >> r;
      hs.push_back(h);
      rs.push_back(r);
    }
  }

  {
    int n; cin >> n;
    rep (_, n) {
      int h, r; cin >> h >> r;
      hs.push_back(h);
      rs.push_back(r);
    }
  }

  const int N = hs.size();
  vector<vector<int>> d(N);

  rep (i, N) {
    rep (j, N) {
      if ((hs[i] < hs[j] && rs[i] < rs[j])) {
        d[i].push_back(j);
      }
    }
  }

  int ans = 0;
  vector<bool>used(N, false);
  rep (i, N) {
    if (used[i]) continue;
    stack<pair<int,int>> s;
    s.push(cons(i, 1));
    while (!s.empty()) {
      auto t = s.top(); s.pop();
      used[car(t)] = true;
      for (int j : d[car(t)]) {
        s.push(cons(j, cdr(t) + 1));
      }
      ans = max(ans, cdr(t));
    }
  }
  cout << ans << endl;

  goto more;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef pair<int, int> Doll;
vector<Doll> Dolls;
int dp[201];

void debug(){
  for(int i = 0; i < Dolls.size(); i++){
    cout << "(" << Dolls[i].first << ", " << Dolls[i].second << ")" << endl;
  }
}

bool comp(const Doll& d1, const Doll& d2){
  return ((d1.first <= d2.first) && (d1.second <= d2.second));
}

int main(void){
  int n, m;
  while(cin >> n, n){
    Dolls.clear();
    Dolls.push_back(Doll(0, 0));
    for(int i = 0; i < n; i++){
      int h, r;
      cin >> h >> r;
      Dolls.push_back(Doll(h, r));
    }
    cin >> m;
    for(int i = 0; i < m; i++){
      int h, r;
      cin >> h >> r;
      Dolls.push_back(Doll(h, r));
    }
    sort(Dolls.begin(), Dolls.end(), comp);
    for(int i = 1; i < Dolls.size(); i++){
      int max_k = 0;
      for(int j = 0; j < i; j++){
        if(Dolls[j].first < Dolls[i].first && Dolls[j].second < Dolls[i].second && dp[max_k] < dp[j]){
          max_k = j;
        }
      }
      dp[i] = dp[max_k] + 1;
    }
    cout << dp[Dolls.size()-1] + 1 << endl;
    fill(dp, dp + 200, 0);
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define MP(a, b) make_pair(a, b)
#define F first
#define S second
#define INF 1 << 30

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

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

  bool operator<(const D& d)const{
    return (h < d.h && r < d.r);
  }
};

int n, m;
vector<D>s;
int dp[1024];

int main(){
  while(scanf("%d", &n) && n){
    s.clear();
    int h, r;
    rep(i, n){
      scanf("%d%d", &h, &r);
      s.push_back(D(h, r));
    }
    scanf("%d", &m);
    rep(i, m){
      scanf("%d%d", &h, &r);
      s.push_back(D(h, r));
    }

    sort(s.begin(), s.end());
    memset(dp, 0, sizeof(dp));

    int res = 0;
    rep(i, s.size()){
      dp[i] = 1;
      rep(j, i) if(s[j] < s[i]){
	dp[i] = max(dp[i], dp[j] + 1);
      }
      res = max(res, dp[i]);
    }
    printf("%d\n", res);
  }
  return 0;
}