Passport Checking

Interview

Time limit1sMemory limit64 MB

Summary

Count how many passport numbers on a check list appear in a list of stolen numbers, counting duplicates each time.

Level: Easy3 of 10
Topics: Hash map, String
Solved: No attempts yet

Problem

This task comes from the MH370 stolen passport case.

The Interpol database holds $N$ passport numbers reported stolen. You are given $M$ more passport numbers to check. Count how many of the numbers on the check list were reported stolen.

Input

The first line contains an integer $N$ . ( $1 \le N \le 100000$ )

Each of the next $N$ lines contains one passport number reported stolen.

The next line contains an integer $M$ . ( $1 \le M \le 100000$ )

Each of the next $M$ lines contains one passport number to check.

Passport numbers consist of letters and digits only and have length at most 15. Uppercase and lowercase letters are different characters.

Output

Print on the first line how many of the $M$ passport numbers to check were reported stolen. If the same number appears several times on the check list, count it once for every appearance.

Examples2

Example 1

Input

Expected output

Example 2
Input
```
1
A1
1
A1
```
Expected output
```
1
```