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

package main

import (
	"fmt"
	"log"
)

func main() {
	var n int
	if _, err := fmt.Scanf("%d", &n); err != nil {
		log.Fatalln(err)
	}
	s := make([]int, n)
	for i := 0; i < n; i++ {
		if _, err := fmt.Scanf("%d", &s[i]); err != nil {
			log.Fatalln(err)
		}
	}

	var q int
	if _, err := fmt.Scanf("%d", &q); err != nil {
		log.Fatalln(err)
	}
	t := make([]int, q)
	for i := 0; i < q; i++ {
		if _, err := fmt.Scanf("%d", &t[i]); err != nil {
			log.Fatalln(err)
		}
	}
	fmt.Println(linearSearch(s, t))
}

func linearSearch(array1 []int, array2 []int) int {
	var count int
	for _, n2 := range array2 {
		for _, n1 := range array1 {
			if n1 == n2 {
				count++
				break
			}
		}
	}
	return count
}