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: Time Limit Exceeded)

#include<stdio.h>


#define MAX 100001


int kensaku(int S[], int T[], int Q, int N)
{

	int i = 0, j = 0, k = 0, z = 0;
	int EOFcount = 0, V[MAX];

	for (j = 0; j < N; j++) {
		for(k = 0; k < z; k++) {
			if (S[j] == V[k]) {//S[j]の値がV[]の中にあったら
				EOFcount++;
				break;
			}
		}
		for (i = 0; i < Q; i++) {
			if (EOFcount == 1) { break; }

			if (T[i] == S[j]) {//TとSが同じ値なら
				V[z] = T[i];
				z++;
				break;
			}
		}
		EOFcount = 0;
		}

	return z;
}



int main(void)
{
	int i;
	int n, q, count = 0;
	int s[MAX], t[MAX];

	/////一つ目の配列の要素数と要素/////
	scanf("%d", &n);

	for (i = 0; i < n; i++) {
		scanf("%d", &s[i]);
	}
	////////////////////////////////////

	/////二つ目の配列の要素数と要素/////
	scanf("%d", &q);

	for (i = 0; i < q; i++) {
		scanf("%d", &t[i]);
	}
	////////////////////////////////////

	printf("%d\n", count = kensaku(s, t, q, n));

	return 0;
}