#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int f[1001][1001],n,m,a[1001],b[1001];
int main(){
	freopen("lcis.in","r",stdin);
	freopen("lcis.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	cin>>m;
	for(int i=1;i<=m;i++)cin>>b[i];
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i]!=b[j])f[i][j]=f[i-1][j];
			else{
				for(int k=0;k<j;k++){
					if(b[k]<b[j])f[i][j]=max(f[i][j],f[i][k]+1);
				}
			}
		}
	}
	int ma=0;
	for(int i=1;i<=m;i++)ma=max(ma,f[n][i]);
	cout<<ma;
	return 0;
}