def search(S, n, t):
    i=0
    S[n]=t
    while (S[i] != t):
        i+=1
    return i!=n

sum=0

n=int(input())
S=list(map(int, input().split()))

S.append([0]*10000)

q=int(input())
T=list(map(int, input().split()))

for i in range(0,q):
    if search(S,n,T[i]):
        sum+=1

print(sum) def search(S, n, t):
    i=0
    S[n]=t
    while (S[i] != t):
        i+=1
    return i!=n search i=0 i 0 S[n]=t S[n] S n t while (S[i] != t):
        i+=1
     S[i] != t S[i] S i t i+=1 i 1 return i!=n i!=n i n S S n n t t sum=0 sum 0 n=int(input()) n int(input()) int input() input S=list(map(int, input().split())) S list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split S.append([0]*10000) S.append S append [0]*10000 [0] 0 10000 q=int(input()) q int(input()) int input() input T=list(map(int, input().split())) T list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split for i in range(0,q):
    if search(S,n,T[i]):
        sum+=1 i range(0,q) range 0 q if search(S,n,T[i]):
        sum+=1 search(S,n,T[i]) search S n T[i] T i sum+=1 sum 1 print(sum) print sum S=list(map(int, input().split())) list(map(int, input().split())) S q=int(input()) int(input()) q def search(S, n, t):
    i=0
    S[n]=t
    while (S[i] != t):
        i+=1
    return i!=n def search(S, n, t):
    i=0
    S[n]=t
    while (S[i] != t):
        i+=1
    return i!=n search T=list(map(int, input().split())) list(map(int, input().split())) T n=int(input()) int(input()) n sum+=1 1 sum sum=0 0 sum
def search(S, n, t):
    i=0
    S[n]=t
    while (S[i] != t):
        i+=1
    return i!=n

sum=0

n=int(input())
S=list(map(int, input().split()))

S.append([0]*10000)

q=int(input())
T=list(map(int, input().split()))

for i in range(0,q):
    if search(S,n,T[i]):
        sum+=1

print(sum)