/*
 * Problem Description: Linear Search
 * Category:
 * Author: Khan
 * Date: 13th October, 2017
 */

#include <stdio.h>

int Search(int A[], int n, int key)
{
    int i =0;
    A[n] = key;
    while(A[i] != key)
        i++;
    return i != n;
}

int main(int argc, char const *argv[])
{
    //freopen("sample.txt", "r", stdin);
    int i, n, A[10000 + 1], q, key, sum = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i)
    {
        scanf("%d", &A[i]);
    }
    scanf("%d", &q);
    for (int i = 0; i < q; ++i)
    {
        scanf("%d", &key);
        if(Search(A, n, key))
            sum++;
    }
    printf("%d\n", sum);
    return 0;
}