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]. 
#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) {
  while (b > 0) {
    a = a % b;
    a ^= b;
    b ^= a;
    a ^= b;
  }
  return a;
}
long long mcm(long long a, long long b) { return a * b / GCD(a, b); }
vector<int> KMP(string _text, string _pattern) {
  vector<int> matches;
  int* P = new int[1005];
  int n_pattern = _pattern.size();
  int n_text = _text.size();
  for (int i = 0; i < n_pattern; i++) P[i] = -1;
  for (int i = 0, j = -1; i < n_pattern;) {
    while (j > -1 && _pattern[i] != _pattern[j]) j = P[j];
    i++;
    j++;
    P[i] = j;
  }
  for (int i = 0, j = 0; i < n_text;) {
    while (j > -1 && _text[i] != _pattern[j]) j = P[j];
    i++;
    j++;
    if (j == n_pattern) {
      matches.push_back(i - n_pattern);
      j = P[j];
    }
  }
  return matches;
}
long long computeHash(string s) {
  const long long p = 31;
  const long long m = 1e9 + 9;
  long long hashValue = 0;
  long long pPow = 1;
  int ncharacter = s.size();
  char c;
  for (int i = 0; i < ncharacter; i++) {
    c = s[i];
    hashValue = (hashValue + (c - 'a' + 1) * pPow) % m;
    pPow = (pPow * p) % m;
  }
  return hashValue;
}
vector<vector<int> > group_identical_strings(vector<string> const& s) {
  int n = s.size();
  vector<pair<long long, int> > hashes(n);
  for (int i = 0; i < n; i++) hashes[i] = {computeHash(s[i]), i};
  sort(hashes.begin(), hashes.end());
  vector<vector<int> > groups;
  for (int i = 0; i < n; i++) {
    if (i == 0 || hashes[i].first != hashes[i - 1].first) {
      vector<int> aux;
      groups.push_back(aux);
    }
    groups.back().push_back(hashes[i].second);
  }
  return groups;
}
void solve() {
  int n;
  cin >> n;
  long long candy[n];
  long long oranges[n];
  long long maxCandy = 9223372036854775807, maxOrange = 9223372036854775807,
            moves = 0;
  for (int i = 0; i < (int)n; i++) {
    cin >> candy[i];
    maxCandy = min(maxCandy, candy[i]);
  }
  for (int i = 0; i < (int)n; i++) {
    cin >> oranges[i];
    maxOrange = min(maxOrange, oranges[i]);
  }
  for (int i = 0; i < (int)n; i++) {
    moves += max(candy[i] - maxCandy, oranges[i] - maxOrange);
  }
  cout << moves;
  cout << "\n";
  ;
}
int main() {
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(0);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int casos;
  cin >> casos;
  while (casos--) solve();
  return 0;
}
