Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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>
void swap(int *,int*);
void bable(int *,int );
int main() {
	int a[10000], b[10000],an,bn,key = -1,cnt=0,i,j;
	scanf("%d", &an);
	for ( i = 0; i <an; i++)
	{
		scanf("%d", &a[i]);
	}
	scanf("%d", &bn);
	for (i = 0; i < bn; i++)
	{
		scanf("%d", &b[i]);
	}
	bable(a, an);
	bable(b, bn);
	for ( i = 0; i < bn; i++)
	{
		for (j = 0; j < an; j++)
		{
			if (a[j] != key) {
				if (b[i] == a[j])
				{
					cnt++;
					key = b[i];
				}
			}
		}
	}
	printf("%d", cnt);
	printf("\n");
	return 0;
}
void swap(int *a, int *b) {
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}
void bable(int *x, int y) {
	int i,j;
	for ( i = 0; i < y-1 ; i++)
	{
		for ( j = y-1; j > i; j--)
		{
			if (x[j -1] > x[j] )
			{
				swap(&x[j - 1], &x[j]);
			}
		}
	}

}