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 <bits/stdc++.h>

using namespace std;

int main() {
  
  int N; cin >> N;
  int a[N];
  for(int i=0; i<N; i++) scanf("%d", &a[i]);
  int Q; cin >> Q;
  int b[Q];
  for(int i=0; i<Q; i++) scanf("%d", &b[i]);
  bool c[Q];
  for(int i=0; i<Q; i++) c[i] = false;
  int ans = 0;
  for(int i=0; i<N; i++) {
    for(int j=0; j<Q; j++) {
      if(a[i] == b[j] && !c[j]) c[j] = true, ans++;
    }
  }
  printf("%d\n", ans);
  return 0;
}