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{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] s = new int[n+1];
    for(int i = 0; i < n; i++){s[i] = sc.nextInt();}
    int q = sc.nextInt();
    int[] t = new int[q];
    for(int i = 0; i < q; i++){t[i] = sc.nextInt();}
    int max = n;
    int cnt = 0;

    for(int i = 0 ; i < q; i++){
      if(banpei(s, t[i], max)){cnt++;}
    }

    System.out.println(cnt);
  }

  public static boolean banpei(int[] s, int key, int max){
    int i = 0;
    s[max] = key;

    while(true){
      if(s[i] == key){
        break;
      }
      i++;
    }

    if(i == max){return false;}
    return true;
  }
}