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 C# (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using static System.Console;

namespace LinearSearch
{
    internal class Program
    {
        public static void Main(string[] args)
        {
            var n = int.Parse(ReadLine());
            var seq1 = ReadLine().Split(' ').Select(int.Parse).Distinct();
            var q = int.Parse(ReadLine());
            var seq2 = ReadLine().Split(' ').Select(int.Parse);

            var count = 0;
            foreach (var key in seq2)
            {
                if (LinearSearch(seq1, key) != -1) count++;
            }
            WriteLine(count);
        }

        private static int LinearSearch<T>(IEnumerable<T> col, T key)
            where T:IComparable
        {
            var i = 0;
            var list = col.ToList();
            while (list[i].CompareTo(key) != 0)
            {
                i++;
                if (i == list.Count - 1)
                {
                    return -1;
                }
            }


            return i;
        }
    }
    
}