|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||6||6||6||100.000%|
Ivan sent N drone warriors to the final battle against Tony Stark, also known as Iron Man. Each drone has a defined frequency, expressed as an integer number, on which it receives commands from Ivan during the fight. Jarvis, the artificial intelligence developed by Toni, has to determine which frequencies those are and thereby take control over as many drones as possible.
Jarvis knows the original factory values of the frequency for each drone, but the frequencies required for each drone, unfortunately, have been changed in the meantime.
Jarvis has only one attempt. He can choose an integer number X and increase each of the factory frequencies by X (X may be negative as well). After that, Jarvis will take over control of each drone whose modified factory frequencies and the one required by the specific drone is equal.
Write a program that will determine how much drone warriors Jarvis can take control over.
The first line contains the integer number N (1 ≤ N ≤ 100 000), the number of drones from the task statement.
In the second line there are N integers Ai (-1 000 000 ≤ Ai ≤ 1 000 000) representing the factory frequency values of the drone warrior.
In the third line there are N integers Bi (-1 000 000 ≤ Bi ≤ 1 000 000) representing the required frequency values of the drone warriors.
In the only line, print out the largest number of drone warriors Jarvis can take control over.
1 1 2
2 0 0 1 1
2 1 2 5 5
If we choose X = 3, the factory frequencies will be 4 and 5, respectively (1 + 3 and 2 + 3), then Jarvis would take control only over the second drone warrior. If we choose X = 4, the factory frequencies will be 5 and 6 and then Jarvis would only take control over the first drone warrior. There is also no X such that Jarvis simultaneously takes control over both drone warriors.