You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies and b_i oranges.

During one move, you can choose some gift 1 ≤ i ≤ n and do one of the following operations:

  * eat exactly one candy from this gift (decrease a_i by one); 
  * eat exactly one orange from this gift (decrease b_i by one); 
  * eat exactly one candy and exactly one orange from this gift (decrease both a_i and b_i by one). 



Of course, you can not eat a candy or orange if it's not present in the gift (so neither a_i nor b_i can become less than zero).

As said above, all gifts should be equal. This means that after some sequence of moves the following two conditions should be satisfied: a_1 = a_2 = ... = a_n and b_1 = b_2 = ... = b_n (and a_i equals b_i is not necessary).

Your task is to find the minimum number of moves required to equalize all the given gifts.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 1000) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1 ≤ n ≤ 50) — the number of gifts. The second line of the test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9), where a_i is the number of candies in the i-th gift. The third line of the test case contains n integers b_1, b_2, ..., b_n (1 ≤ b_i ≤ 10^9), where b_i is the number of oranges in the i-th gift.

Output

For each test case, print one integer: the minimum number of moves required to equalize all the given gifts.

Example

Input


5
3
3 5 6
3 2 3
5
1 2 3 4 5
5 4 3 2 1
3
1 1 1
2 2 2
6
1 1000000000 1000000000 1000000000 1000000000 1000000000
1 1 1 1 1 1
3
10 12 8
7 5 4


Output


6
16
0
4999999995
7

Note

In the first test case of the example, we can perform the following sequence of moves:

  * choose the first gift and eat one orange from it, so a = [3, 5, 6] and b = [2, 2, 3]; 
  * choose the second gift and eat one candy from it, so a = [3, 4, 6] and b = [2, 2, 3]; 
  * choose the second gift and eat one candy from it, so a = [3, 3, 6] and b = [2, 2, 3]; 
  * choose the third gift and eat one candy and one orange from it, so a = [3, 3, 5] and b = [2, 2, 2]; 
  * choose the third gift and eat one candy from it, so a = [3, 3, 4] and b = [2, 2, 2]; 
  * choose the third gift and eat one candy from it, so a = [3, 3, 3] and b = [2, 2, 2]. 
import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        new Main().run(); 
    }

    private StreamTokenizer in;
    private PrintWriter out;

    private void run() throws IOException  {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);
        solve();
        out.flush();
    }

    private int nextInt() throws IOException {
        in.nextToken();

        return (int)in.nval;
    }

    private void solve() throws IOException {
        final int totalCases = nextInt();

        for (int i = 0; i < totalCases; i++) {
            final int length = nextInt();
            final int[] a = new int[length];
            final int[] b = new int[length];

            for (int j = 0; j < length; j++) {
                a[j] = nextInt();
            }

            for (int j = 0; j < length; j++) {
                b[j] = nextInt();
            }

            final long min = getMin(a, b);

            out.print(min);
            out.print("\n");
        }

        //final long min1 = getMin(new int[]{3, 5, 6}, new int[]{3, 2, 3});
        //final long min2 = getMin(new int[]{1, 2, 3, 4, 5}, new int[]{5, 4, 3, 2, 1});
        //final long min3 = getMin(new int[]{1, 1, 1}, new int[]{2, 2, 2});
        //final long min4 = getMin(new int[]{1, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000}, new int[]{1, 1, 1, 1, 1, 1});
        //final long min5 = getMin(new int[]{10, 12, 8}, new int[]{7, 5, 4});

        //out.print("min1: " + min1 + "\n");
        //out.print("min2: " + min2 + "\n");
        //out.print("min3: " + min3 + "\n");
        //out.print("min4: " + min4 + "\n");
        //out.print("min5: " + min5 + "\n");
    }

    private long getMin(int[] a, int[] b) {
        // find aMin
        int aMin = Integer.MAX_VALUE;
        for (int i = 0; i < a.length; i++) {
            if (a[i] < aMin) {
                aMin = a[i];
            }
        }

        // find bMin
        int bMin = Integer.MAX_VALUE;
        for (int i = 0; i < a.length; i++) {
            if (b[i] < bMin) {
                bMin = b[i];
            }
        }

        // find how many I can take both candles and oranges
        // find max(minA, minB)
        // apples = a[i] - minA
        // oranges = b[i] - minB
        
        // if (apples > 0 && oranges > 0) {
        // minAO = min(apples, oranges);
        // count = minAO + (apples - minAO) + (oranges - minAO)
        
        long count = 0;
        for (int i = 0; i < a.length; i++) {
            final int aCount = a[i] - aMin;
            final int bCount = b[i] - bMin;

            if (aCount > 0 && bCount > 0) {
                final int minAB = aCount < bCount ? aCount : bCount;

                count += minAB + (aCount - minAB) + (bCount - minAB);
            } else if (aCount > 0) {
                count += aCount;
            } else if (bCount > 0) {
                count += bCount;
            }

            //while (a[i] > aMin || b[i] > bMin) {
            //    if (a[i] > aMin && b[i] > bMin) {
            //        a[i]--;
            //        b[i]--;
            //        count++;
            //    } else if (a[i] > aMin) {
            //        a[i]--;
            //        count++;
            //    } else if (b[i] > bMin) {
            //        b[i]--;
            //        count++;
            //    }
            //}
        }

        return count;
    }
}
