Problem G
Judging Troubles
Input
The input consists of:

one line with one integer $n$ ($1\leq n \leq 10^5$), 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 1  Sample Output 1 

5 correct wronganswer correct correct timelimit wronganswer correct timelimit correct timelimit 
4 