问题 H: Matches

Walk Alone has two rows of matches, each of which contains $n$ matches. He defines the distance between them as d=∑ⁿ_i=1∣ai−bi∣, where ai and bi represent the height of the i-th match in the first row and the second row, respectively. Walk Alone wants to beautify the matches by shortening the distance, and you are asked to find out the minimum distance after performing at most one swap within one row. Note that the height can be negative.

The first line contains one integer n (1≤n≤10^6), denoting the number of matches in each row.
The second and the third line both contains $n$ integers, representing the height of matches in the first row and the second row, respectively. All of these numbers satisfy ∣ai∣,∣bi∣≤10^9.

Print one line containing a single integer, the minimum distance you can get.

3
1 2 3
3 2 1

0