Kazusa’s Party
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Hojo High School light music club has accomplished their final performance on stage. After the performance, Kazusa invites Haruki and Setsuna to her home to join a party.

As people in this party are not familiar with each other, Kazusa comes up with an idea: she gives an integer to everyone.

And a BOY with integer can match a GIRL with integer if and only if:

Besides, a BOY can only match at most one GIRL.

As Kazusa is careless, different people may have the same integer. Now Kazusa wants to know the maximum number of matches she can get.

输入描述:

The first line contains one integer  indicating the number of boys and girls in this party.
The second line contains  numbers indicating the integer of different boys.
The third line contains  numbers indicating the integer of different girls.
All integers are greater than  and smaller or equal to .

输出描述:

Output one single integer indicating the maximum number of matches.
示例1

输入

复制 
3
2 4 6
3 10 2

输出

复制 
3
示例2

输入

复制 
3
2 4 8
5 7 9

输出

复制 
0