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.HashSet;
public class Main {

  /*
  // This was too slow
  public static boolean find(int[] ary, int n) {
    int low = 0;
    int high = ary.length-1;
    while (low <= high) {
      int mid = high - low / 2;
      if (ary[mid] == n)
        return true;
      if (n < ary[mid])
        high = mid - 1;
      else if (n > ary[mid])
        low = mid + 1;
    }
    return false;
  }
  */

  public static void main(String[] args) {
    Scanner s = new Scanner(System.in);
    int n = s.nextInt();
    HashSet<Integer> set = new HashSet<Integer>();
    for (int i = 0; i < n; i++) {
      set.add(s.nextInt());
    }
    int q = s.nextInt();
    int[] T = new int[q];
    for (int i = 0; i < q; i++) {
      T[i] = s.nextInt();
    }
    s.close();
    int count = 0;
    for (int t : T) {
      if (set.contains(t))
        count++;
    }
    System.out.println(count);
  }
}

