#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<cstring>
#include<string>
#include<deque>
#define maxn 1010
#define itn int
#define xlm mylove
using namespace std;
typedef long long LL;typedef unsigned long long ULL;
int a[maxn],b[maxn],n,m,f[maxn],temp,Max=-1;
inline void in(){
//	freopen("a.in","r",stdin);
	freopen("lcis.in","r",stdin);
	freopen("lcis.out","w",stdout);
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	scanf("%d",&m);
	for (int i=1;i<=m;i++){
		scanf("%d",&b[i]);
	}
}
inline void dp(){
	memset(f,0,sizeof(f));
	for (int i=1;i<=n;i++){
		int temp=0;
		for (int j=1;j<=m;j++){
			if(a[i]>b[j]){
			  if (f[j]>temp)
			   temp=f[j];
			} 
            if(a[i]==b[j]) f[j]=temp+1;
            if(f[j]>Max) Max=f[j];
	}
}}
inline void p(){
	printf("%d",Max);
}
int Main(){
	in();
	dp();
	p();
	return 0;
}
int main(){;}
int xlm=Main();