Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Gambling

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputTwo players A and B have a list of $$$n$$$ integers each. They both want to maximize the subtraction between their score and their opponent's score.

In one turn, a player can either add to his score any element from his list (assuming his list is not empty), the element is removed from the list afterward. Or remove an element from his opponent's list (assuming his opponent's list is not empty).

Note, that in case there are equal elements in the list only one of them will be affected in the operations above. For example, if there are elements $$$\{1, 2, 2, 3\}$$$ in a list and you decided to choose $$$2$$$ for the next turn, only a single instance of $$$2$$$ will be deleted (and added to the score, if necessary).

The player A starts the game and the game stops when both lists are empty. Find the difference between A's score and B's score at the end of the game, if both of the players are playing optimally.

Optimal play between two players means that both players choose the best possible strategy to achieve the best possible outcome for themselves. In this problem, it means that each player, each time makes a move, which maximizes the final difference between his score and his opponent's score, knowing that the opponent is doing the same.

Input

The first line of input contains an integer $$$n$$$ ($$$1 \le n \le 100\,000$$$) — the sizes of the list.

The second line contains $$$n$$$ integers $$$a_i$$$ ($$$1 \le a_i \le 10^6$$$), describing the list of the player A, who starts the game.

The third line contains $$$n$$$ integers $$$b_i$$$ ($$$1 \le b_i \le 10^6$$$), describing the list of the player B.

Output

Output the difference between A's score and B's score ($$$A-B$$$) if both of them are playing optimally.

Examples

Input

2

1 4

5 1

Output

0

Input

3

100 100 100

100 100 100

Output

0

Input

2

2 1

5 6

Output

-3

Note

In the first example, the game could have gone as follows:

- A removes $$$5$$$ from B's list.
- B removes $$$4$$$ from A's list.
- A takes his $$$1$$$.
- B takes his $$$1$$$.

Hence, A's score is $$$1$$$, B's score is $$$1$$$ and difference is $$$0$$$.

There is also another optimal way of playing:

- A removes $$$5$$$ from B's list.
- B removes $$$4$$$ from A's list.
- A removes $$$1$$$ from B's list.
- B removes $$$1$$$ from A's list.

The difference in the scores is still $$$0$$$.

In the second example, irrespective of the moves the players make, they will end up with the same number of numbers added to their score, so the difference will be $$$0$$$.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/17/2018 03:04:46 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|