Absolute Game

Absolute Game

Alice and Bob are playing a game. Alice has an array aa of n integers, Bob has an array bb of n integers. In each turn, a player removes one element of his array. Players take turns alternately. Alice goes first.

The game ends when both arrays contain exactly one element. Let x be the last element in Alice’s array and y be the last element in Bob’s array. Alice wants to maximize the absolute difference between x and y while Bob wants to minimize this value. Both players are playing optimally.

Find what will be the final value of the game.

Input
The first line contains a single integer n (1≤n≤1000) — the number of values in each array.

The second line contains n space-separated integers a1,a2,…,an (1≤ai≤10^9) — the numbers in Alice’s array.

The third line contains nn space-separated integers b1,b2,…,bn (1≤bi≤10^9) — the numbers in Bob’s array.

Output
Print the absolute difference between x and y if both players are playing optimally.

Examples
input
4
2 14 7 14
5 10 9 22
output
4
input
1
14
42
output
28

Note
In the first example, the x=14 and y=10. Therefore, the difference between these two values is 4.

In the second example, the size of the arrays