Judging Troubles#7860
The organizers of NWERC decided to improve the automatic judging of submissions in the contest and are now using two systems: DOMjudge and Kattis. Each submission is evaluated by both systems, and the results are compared to ensure the systems are consistent. However, a failure occurred while setting up communication between the systems: the jury now only knows the sets of results from both systems, but not which result corresponds to which submission.
Your task is to help determine how many results could have matched between the systems.
Consists of:
A single integer n~(1 \le n \le 10^5) — the number of submissions;
lines — the results from the DOMjudge system in arbitrary order;
lines — the results from the Kattis system, also in arbitrary order.
Each line is a result string of length between and characters, consisting only of lowercase Latin letters.
Print a single number — the maximum number of results that could have matched in both systems.
Example 1