e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Judging Troubles

Judging Troubles

The NWERC organisers have decided that they want to improve the automatic grading of the submissions for the contest, so they now use two systems: DOMjudge and Kattis. Each submission is judged by both systems and the grading results are compared to make sure that the systems agree. However, something went wrong in setting up the connection between the systems, and now the jury only knows all results of both systems, but not which result belongs to which submission! You are therefore asked to help them figure out how many results could have been consistent.

Input

Consists of:

  • one line with one integer n (1n105), 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.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
correct
wronganswer
correct
correct
timelimit
wronganswer
correct
timelimit
correct
timelimit
Output example #1
4
Source 2014 ACM North Western European Regional Contest (NWERC), Ноябрь 30, Problem J