n = int(input())
nlist = list(map(int, input().split()))
m = int(input())
mlist = list(map(int, input().split()))

dp = [[0] * (m+1) for x in range(n+1)]
for i in range(1, n+1):
    for j in range(1, m+1):
        dp[i][j] = max(dp[i-1][j], dp[i][j-1])
        if nlist[i-1] == mlist[j-1]:
            dp[i][j] = dp[i-1][j-1] + 1

print(dp[n][m])