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
#include<iostream>
using namespace std;
int t[100000];
int n,m,a,b,ans=0,L,R,M;
int main(){
  cin>>n;
  for(int i=0;i<n;i++)cin>>t[i];
  cin>>m;
  for(int i=0;i<m;i++){
    cin>>a;
    L=0;
    R=n;
    while(L<R){
      M=(L+R)/2;
      if(t[M]==a){
	break;
      }else if(t[M]<a){
	L=M+1;
      }else{
	R=M;
      }
    }
    
    if(L<R)ans++;
    
  }
  cout<<ans<<endl;
  return 0;
}