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 (
	"bufio"
	"fmt"
	"os"
	"strings"
)

func main() {
	stdin := bufio.NewScanner(os.Stdin)
	stdin.Scan()
	//n := stdin.Text()
	stdin.Scan()
	s := stdin.Text()
	stdin.Scan()
	//q := stdin.Text()
	stdin.Scan()
	t := stdin.Text()

	cnt := 0
	for _, tv := range strings.Split(t, " ") {
		for _, sv := range strings.Split(s, " ") {
			if tv == sv {
				cnt++
				break
			}
		}
	}
	fmt.Println(cnt)

}