本站作为LDUOnlineJudge的测试版本进行演示,官方网站请访问http://icpc.ldu.edu.cn
[Hidden]

1316. D. Boots Exchange


Description

A boot shop has received a shipment from the factory consisting of N left boots and N right boots. Each boot has some integer size, and a left and right boot will form a proper pair if they have equal sizes. Each boot can only belong to a single pair. The employees of the boot store want to create N proper pairs of boots. Fortunately, the factory has offered to exchange any number of boots in the shipment with new boots of different sizes.



The Problem:
Given the size of the left boots and right boots, your task is to determine the least number of boots that need to be exchanged.

Input

The first line of input contains the integer N. Next line contains N positive integers separated by a single space. These are the size of the left boots. Next line contains N positive integers separated by a single space. These are the size of the right boots. N is between 1 and 100 inclusive, and each boot size is between 1 and 99,999 inclusive.

Output

Output the least number of boots that need to be exchanged.

Samples

Input Copy
3
1 3 1
2 1 3
Output
1

Source

UCF2018 PRACTICE
Problem Information

Time Limit: 1000MS (C/C++,Others×2)
Memory Limit: 128MB (C/C++,Others×2)
Special Judge: No
AC/Submit: 1 / 1
Tags:
Contests involved

1035. UCF 2018 Practice
My history solutions

You didn't submit any solution!
Submit your solution

Login Register