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 math
import sys
from sys import *
import heapq
from collections import deque, defaultdict
from itertools import permutations, combinations, combinations_with_replacement
import random
import os

mod = 10**9+7 #1000000007
MAX = sys.maxsize #maximum size
MIN = -sys.maxsize-1 #minimum size

#----------Check Prime numbers----------------
def isPrime(n):
    if n>1:
        for i in range(2,n):
            if (n%i) == 0:
                return False
        else:
            return True
    else:
        return False
#----------Check Panagram-----------------------
def isPanagram(s):
    alphabet = 'abcdefghijklmnopqrstuvwxyz'
    for char in alphabet:
        if char not in s.lower():
            return False
    return True

#----------Check if number is power of 2--------
def power2(n):
	return n and (not (n & n-1))

#----------Find difference between elements-----
def diff(list1):
    res = [list1[i+1] - list1[i] for i in range(len(list1)-1)]
    return res

#----------List with same elements--------------
def isEqual(list1):
    if len(list1)<0:
        res = True
    res = all(ele == list1[0] for ele in list1)
    if(res):
        return True
    else:
        return False

#-----Check Palindrome can be formed or not-----
def checkPali(s):
    ar = [0]*256
    for i in range(len(s)):
        ar[ord(s[i])] = ar[ord(s[i])]+1
    odd = 0
    for i in range(256):
        if ar[i]&1:
            odd +=1
        if odd>1:
            return False
    return True

#-----Removing duplicate elements from a list---
def remove_duplicate(list1):
    final_list = list(set(list1))
    return final_list

#-----------------Solve it----------------------
def solve():
    n = int(input())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    ar1 = []
    ar2 = []
    arr = []
    m1 = min(a) 
    m2 = min(b)
    for i in range(n):
        ar1.append((a[i]-m1))
        ar2.append(b[i]-m2)
    for i in range(n):
        arr.append(max(ar1[i], ar2[i]))
    return sum(arr)
        
        
#------------------Main-------------------------
if __name__ == '__main__':
    t = int(stdin.readline().strip())
    for i in range(t):
        result = solve()
        stdout.write(str(result)+'\n')
        #O/P FOR KICKSTART
        #stdout.write('CASE'+' '+'#'+str(i+1)+':'+' '+str(result)+'\n')
    
    
