write a go solution for Description:
Kirill has two integer arrays a_1,a_2,ldots,a_n and b_1,b_2,ldots,b_n of length n. He defines the absolute beauty of the array b as \sum_{i=1}^{n} |a_i - b_i|. Here, |x| denotes the absolute value of x.

Kirill can perform the following operation at most once:

- select two indices i and j (1<=i<j<=n) and swap the values of b_i and b_j.

Help him find the maximum possible absolute beauty of the array b after performing at most one swap.

Input Format:
Each test contains multiple test cases. The first line contains the number of test cases t (1<=qt<=q10,000). The description of test cases follows.

The first line of each test case contains a single integer n (2<=n<=2*10^5) — the length of the arrays a and b.

The second line of each test case contains n integers a_1,a_2,ldots,a_n (1<=a_i<=10^9) — the array a.

The third line of each test case contains n integers b_1,b_2,ldots,b_n (1<=b_i<=10^9) — the array b.

It is guaranteed that the sum of n over all test cases does not exceed 2*10^5.

Output Format:
For each test case, output one integer — the maximum possible absolute beauty of the array b after no more than one swap.

Note:
In the first test case, each of the possible swaps does not change the array b.

In the second test case, the absolute beauty of the array b without performing the swap is |1-1|+|2-2|=0. After swapping the first and the second element in the array b, the absolute beauty becomes |1-2|+|2-1|=2. These are all the possible outcomes, hence the answer is 2.

In the third test case, it is optimal for Kirill to not perform the swap. Similarly to the previous test case, the answer is 2.

In the fourth test case, no matter what Kirill does, the absolute beauty of b remains equal to 16.. Output only the code with no comments, explanation, or additional text.