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]. 
# def help():
# 	n,q = map(int,input().split(" "))

# 	height = list(map(int,input().split(" ")))
# 	reward = list(map(int,input().split(" ")))

# 	if( n<= 1000 and q<= 1000):
# 		for qw in range(q):
# 			a,b,c = map(int,input().split(" "))
# 			b -= 1
# 			if( a == 1 ):
# 				height[b] = c
# 			# else:
# 			# 	if( height[b] > height[c] ):
				
					
# 			# 		for i in range(b,c+1,-1):



# 			# 	else:
# 	else:
# 		visited = [0]*n
# 		for i in range(n):
# 			if(height)

			
# for _ in range(1):
# 	help()
# from sys import stdin
# input = stdin.readline

# n = int(input())
# arr = list(map(int,input().split(" ")))

# dp = [[0]*n for i in range(n)]

# for i in range(1,n):
# 	arr[i] = arr[i]+arr[i-1]

# for l in range(2,n+1):
# 	for i in range(n-l+1):
# 		j = i+l-1
# 		if(i == 0 ):
# 			cnt = arr[j]
# 		else:
# 			cnt = arr[j] - arr[i-1]
# 		for k in range(i+1,j+1):
# 			dp[i][j] = max(dp[i][j] ,dp[i][k-1]+dp[k][j]+cnt)

# print dp[0][n-1]


# from random import randint

# n = 300
# points = []
# x = set()
# y = set()
# while len(x)!=n:
# 	x.add(randint(1,500))
# while len(y)!=n:
# 	y.add(randint(1,500))
# x = sorted(list(x))
# y = sorted(list(y))
# freq = [randint(1,10) for i in range(n)]
# mindist = 100000000000000
# minpts = []
# for i in range(500):
# 	# print(i)
# 	for j in range(500):
# 		cd = 0
# 		for k in range(n):
# 			cd += (abs(i-x[k])+ abs(j-y[k]))*freq[k]
		
# 		if(cd < mindist):
# 			mindist = cd
# 			minpts = [(i,j)]
# 		elif(cd == mindist):
# 			minpts.append((i,j))
# print(mindist)
# # print(minpts)

# valid = []
# for i in minpts:
# 	if(i[0] in x and i[1] in y):
# 		valid.append(i)
# print(valid)

# xrep = []
# yrep = []

# for i in range(n):
# 	for j in range(freq[i]):
# 		xrep.append(x[i])
# 		yrep.append(y[i])

# n1 = len(xrep)

# cd = 0
# for k in range(n):
# 	cd += (abs(xrep[n1//2]-x[k])+ abs(yrep[n1//2]-y[k]))*freq[k]

# print(cd)
# print((xrep[n1//2],yrep[n1//2]))



from sys import stdin
input = stdin.readline

def help():
	n = int(input())
	arr1 = list(map(int,input().split(" ")))
	arr2 = list(map(int,input().split(" ")))

	t1 = min(arr1)
	t2 = min(arr2)

	moves = 0
	for i in range(n):
		d1 = arr1[i] - t1
		d2 = arr2[i] - t2
		moves += max(d1,d2)
	print(moves)
		


for _ in range(int(input())):
	help()