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)

/*
 * Created by SharpDevelop.
 * User: yog-sothoth
 * Date: 2017/03/20
 * Time: 13:33
 * 
 * To change this template use Tools | Options | Coding | Edit Standard Headers.
 */
using System;

namespace DefaultNamespace
{
	/// <summary>
	/// Description of Class1.
	/// </summary>
	public class LinerSearch
	{
		/*
		 *  n????????´??°???????????°???  S??¨???q ????????°????????´??°???????????°???  T??????????????????T ?????????????????´??°????????§ 
		 *  S?????????????????????????????° C  ???????????????????????°????????????????????????????????????
		 * ??\???  :???????????? n???????????????S  ?????¨??? n ????????´??°??????????????? q??????????????? T ?????¨??? q ????????´??°????????????????????????
		 * ?????? C???????????????????????????????????????
		 */
		
		public static void Main(String[] args)
		{
			//????????????
			int n=int.Parse(Console.ReadLine());
			string s=Console.ReadLine();
			string[] sTarget=new string[n+1];//????????¨???????´???°??????????¶???????
			Array.Copy( s.Split(),sTarget,n);
			sTarget[n]="-1";//?????????????´?
			
			int q=int.Parse(Console.ReadLine());
			string t=Console.ReadLine();
			string[] tSearch=t.Split();
			
			
			var search=new Searcher(n,sTarget,q,tSearch);
			Console.WriteLine(search.counter);
		}
		
	}
	public class Searcher
	{
		//??????????????£???????????????
		public int counter{get; private set;}
		int num;//??????????´???°
		int qnum;//??????????´???°
		string[] target;
		string[] searchThis;
		public Searcher(int n,string[] s,int q,string[]t)
		{
			counter =0;
			num=n;
			target=s;
			qnum=q;
			searchThis=t;
			search();
		}
		public void search()
		{//??????????????????
		 for(int j=0;j<qnum;j++)
		 {
			int i=0;//????????????????????????
			string key =searchThis[j];
			target[num]=key;//??????
			while(target[i]!=key)
			{ 
				
				
				i++;
			}
			if (i!=num)//target????????????????´??????????????????????????????????????´???§???????????°
			{
				counter++;
			}
	     }
		}
		
		
		
	}
	
}