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 JAVA (judge verdict: Accepted)

import java.util.*;

public class Main{
    int n;
    long[] a;

    Main(){
	Scanner sc = new Scanner(System.in);
	int cnt, q;

	while(sc.hasNext()){
	    cnt = 0;
	    n = sc.nextInt();
	    if(n == 0) break;
	    a = new long[n];

	    for(int i = 0; i < n; ++i) a[i] = sc.nextLong();
	    Arrays.sort(a);

	    q = sc.nextInt();
	    for(int i = 0; i < q; ++i) if(func(sc.nextLong())) ++cnt;
	    System.out.printf("%d\n", cnt);
	}
    }

    boolean func(long v){
	int p = 0, q = n-1, m;

	while(p <= q){
	    m = (p+q)/2;
	    if(a[m] == v) return true;
	    if(a[m] > v) q = m-1;
	    else p = m+1;
	}

	return false;
    }

    public static void main(String[] args){
	new Main();
    }
}