Problem:
Search II

You are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.

Input

In the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.

Output

Print C in a line.

Constraints

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

0 ≤ an element in S ≤ 109

0 ≤ an element in T ≤ 109

Sample Input 1

5
1 2 3 4 5
3
3 4 1

Sample Output 1

3

Sample Input 2

3
1 2 3
1
5

Sample Output 2

0

Sample Input 3

5
1 1 2 2 3
2
1 2

Sample Output 3

2

Notes

Solution in C (judge verdict: Accepted)

#include <stdio.h>

int main(void)
{
    int i, j, cnt, n1, n2, sum = 0, pivot;
    //int A[100000000], B[100000000];

    scanf("%d", &n1);
    int A[n1];
    for (i = 0; i < n1; i++)
    {
        scanf("%d", &A[i]);
    }

    scanf("%d", &n2);
    int B[n2];
    for (j = 0; j < n2; j++)
    {
        scanf("%d", &B[j]);
    }

    pivot = A[n1 / 2];

    for (j = 0; j < n2; j++)
    {
        if (B[j] < pivot)
        {
            //cnt = 0;
            for (i = 0; i < n1 / 2; i++)
            {
                if (A[i] == B[j])
                {
                    sum += 1;
                    //cnt += 1;
                    break;
                }
            }
        }
        else
        {
            for (i = n1 / 2; i < n1; i++)
            {
                if (A[i] == B[j])
                {
                    sum += 1;
                    //cnt += 1;
                    break;
                }
            }
        }
    }

    printf("%d\n", sum);
    return 0;
}