Two remote camera traps -- one covering the North bank and one covering the South bank of a river crossing -- silently record wildlife activity through the night. Every time an animal triggers a trap, the trap appends that animal's species code (a short lowercase-letter identifier) to its own log for the night; a species that never triggers a given trap simply never appears in that trap's log, and one that triggers a trap several times appears that many times (possibly scattered) through the log. Rangers only trust a sighting when it is unambiguous on both sides of the crossing: a species code counts as a clean single sighting for the night if and only if it appears in the North Camera's log exactly once and in the South Camera's log exactly once. Given both logs for one night, report how many distinct species codes qualify as clean single sightings.

Input format

• Line 1: an integer n, the number of entries in the North Camera log.
• Line 2: n space-separated lowercase strings, the North Camera log entries in the order they were recorded.
• Line 3: an integer m, the number of entries in the South Camera log.
• Line 4: m space-separated lowercase strings, the South Camera log entries in the order they were recorded.

Output format

A single integer: the number of distinct species codes that appear exactly once in the North Camera log and exactly once in the South Camera log.

Constraints

• 1 <= n, m <= 1000
• Each log entry consists of 1 to 20 lowercase English letters ('a'-'z').
• The same species code may repeat any number of times within either log.

4
owl otter owl fox
3
otter fox fox

1

3
lynx wolf lynx
2
wolf moose

1