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)

using System;

class A4{
  public static void Main(){
    int n,q;
    n = int.Parse(Console.ReadLine());
    string[] S = new string[n];
    string[] str = Console.ReadLine().Split(' ');

    for(int i = 0;i < n;i++){
      S[i] = str[i];
    }

    q = int.Parse(Console.ReadLine());
    string[] T = new string[q];
    string[] str2 = Console.ReadLine().Split(' ');

    for(int i = 0;i < q;i++){
      T[i] = str2[i];
    }

    Console.WriteLine(Serach(S,T));

  }

  static int Serach(string[] S,string[] T){
    int count = 0,l = 0;
    bool flag = false;
    string[] memory = new string[S.Length];

    for(int i = 0;i < T.Length;i++){
      if(flag == true) l++;
      flag = false;
      for(int j = 0;j < S.Length;j++){
        if(flag == true && memory[l].CompareTo(S[j]) == 0){
          continue;
        }
        else if(S[j].CompareTo(T[i]) == 0){
          memory[l] = T[i];
          flag = true;
          count++;
          }
      }
    }
    return count;
  }
}