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.

Notes

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

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.

Examples

Input

5
1 2 3 4 5
3
3 4 1


Output

3


Input

3
1 2 3
1
5


Output

0


Input

5
1 1 2 2 3
2
1 2


Output

2
import java.util.Scanner;
import java.util.Arrays;
import java.util.List;

public class Main
{
	public static void main(String args[])
	{
		Scanner sc = new Scanner(System.in);
		int n, q, A[] = new int[100000], m[] = new int[50000];
		n = sc.nextInt();
		for(int i = 0; i < n; i++)
		{
			A[i] = sc.nextInt();
		}
		q = sc.nextInt();
		for(int i = 0; i < q; i++)
		{
			m[i] = sc.nextInt();
		}
		int ans = 0;
		for(int i = 0; i < q; i++)
		{
			int ok = -1;
			int ng = n;
			boolean aru = false;
			while(Math.abs(ok - ng) > 1)
			{
				int mid = (ok + ng) / 2;
				if(A[mid] == m[i])
				{
					aru = true;
					break;
				}
				if(A[mid] > m[i])
				{
					ng = mid;
				}
				else
				{
					ok = mid;
				}
			}
			if(aru)
			{
				++ans;
			}
		}
		System.out.println(ans);
		sc.close();
	}
}
