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: Wrong Answer)

using System;

namespace ALDS1_4_B
{
    public abstract class Array<T>
    {
        protected T[] array;
        public int Count { get; protected set; }
        public Array(int capacity)
        {
            array = new T[capacity];
            Count = 0;
        }
        public Array(int capacity, T initValue)
        {
            array = new T[capacity];
            for (int i = 0; i < capacity; ++i) array[i] = initValue;
            Count = capacity;
        }
    }

    public class List<T> : Array<T>
    {
        public static int AUTOSIZE = 1024;
        public static int INCSIZE = 1024;

        protected int capacity;
        protected readonly int incSize;
        public List(T[] array) : base(array.Length)
        {
            capacity = array.Length;
            incSize = INCSIZE;
            array.CopyTo(this.array, 0);
            Count = array.Length;
        }

        public bool Contains(T element)
        {
            foreach (var e in array) if (e.Equals(element)) return true;
            return false;
        }
    }

    public class SortedList<T> : List<T> where T : IComparable<T>
    {
        public SortedList(T[] array) : base(array) { }
        public int IndexOf(T element)
        {
            int left = 0, right = Count - 1;
            while (left + 1 < right)
            {
                var mid = (left + right) / 2;
                if (element.CompareTo(array[mid]) < 0) right = mid;
                else left = mid;
            }
            if (array[left].Equals(element)) return left;
            else if (array[right].Equals(element)) return right;
            else throw new Exception();
        }
        public new bool Contains(T element)
        {
            try
            {
                IndexOf(element);
                return true;
            }
            catch (Exception)
            {
                return false;
            }
        }
    }
    class Program
    {
        static void Main(string[] args)
        {
            Console.ReadLine();
            var S = new SortedList<string>(Console.ReadLine().Split(' '));
            Console.ReadLine();
            var T = Console.ReadLine().Split(' ');

            int cnt = 0;
            foreach (var a in T)
            {
                if (S.Contains(a)) cnt++;
            }
            Console.WriteLine(cnt);
        }
    }
}