The NWERC organisers have decided that they want toimprove the automatic grading of the submissions forthe contest, so they now use two systems: DOMjudgeand Kattis. Each submission is judged by both systemsand the grading results are compared to make sure thatthe systems agree. However, something went wrongin setting up the connection between the systems, andnow the jury only knows all results of both systems, butnot which result belongs to which submission! You aretherefore asked to help them figure out how many results could have been consistent.
Input
The input consists of:
one line with one integer n (1 ≤ n ≤ 105), the number of submissions;
n lines, each with a result of the judging by DOMjudge, in arbitrary order;
n lines, each with a result of the judging by Kattis, in arbitrary order.
Each result is a string of length between 5 and 15 characters (inclusive) consisting of lowercase letters.
Output
Output one line with the maximum number of judging results that could have been the same for both systems.
Sample
| Input | Output |
|---|---|
5 correct wronganswer correct correct timelimit wronganswer correct timelimit correct timelimit | 4 |
This NWERC 2014 problem is licensed under the CC BY-SA 3.0 license.
You can find the original problem on the NWERC website.
