Alice has recently learned in her economics class that the market is said to be in equilibrium when the supply is equal to the demand.

Alice has market data for N time points in the form of two integer arrays S and D. Here, S_{i} denotes the supply at the i^{th} point of time and D_{i} denotes the demand at the i^{th} point of time, for each 1 ≤ i ≤ N.

Help Alice in finding out the number of time points at which the market was in equilibrium. 

------ Input Format ------ 

- The first line of input will contain an integer T — the number of test cases. The description of T test cases follows.
- Each test case contains three lines of input.
- The first line of each test case contains an integer N, the length of the arrays S and D.
- The second line of each test case contains N space-separated integers S_{1}, S_{2}, \ldots , S_{N}.
- The third line of each test case contains N space-separated integers D_{1}, D_{2}, \ldots , D_{N}. 

------ Output Format ------ 

For each test case, output the number of time points at which the market was in equilibrium.

------ Constraints ------ 

$1 ≤ T ≤ 10$
$1 ≤ N ≤ 100$
$1 ≤ S_{i}, D_{i} ≤ 100$ for every $1 ≤ i ≤ N$

----- Sample Input 1 ------ 
2
4
1 2 3 4
2 1 3 4
4
1 1 2 2
1 2 1 1
----- Sample Output 1 ------ 
2
1
----- explanation 1 ------ 
Test case $1$: For $i = 3$ and $i = 4$, we have supply equal to demand, hence the market is in equilibrium.

Test case $2$: For $i = 1$, we have supply equal to demand, hence the market is in equilibrium.

Difficulty: EASY

Solutions:
t = int(input())
for _ in range(t):
	arr_length = map(int, input().split())
	supplies = list(map(int, input().split()))
	demands = list(map(int, input().split()))
	answer = 0
	for i in range(len(supplies)):
		if supplies[i] == demands[i]:
			answer += 1
	print(answer)


t = int(input())
while t > 0:
	n = int(input())
	c = 0
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	for i in range(n):
		if s[i] == d[i]:
			c += 1
	print(c)
	t -= 1


for _ in range(int(input())):
	n = int(input())
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	count = 0
	for i in range(n):
		if s[i] == d[i]:
			count += 1
	print(count)


t = int(input())
for i in range(t):
	l = int(input())
	S = list(map(int, input().split()))
	D = list(map(int, input().split()))
	c = 0
	for j in range(l):
		if S[j] == D[j]:
			c += 1
	print(c)


for i in range(int(input())):
	n = int(input())
	ars = list(map(int, input().split()))
	ard = list(map(int, input().split()))
	e = 0
	for i in range(n):
		if ars[i] == ard[i]:
			e += 1
	print(e)


for _ in range(int(input())):
	n = int(input())
	m = list(map(int, input().split()))
	l = list(map(int, input().split()))
	count = 0
	for i in range(n):
		if m[i] == l[i]:
			count += 1
	print(count)


for i in range(int(input())):
	n = int(input())
	r = list(map(int, input().split()))
	d = list(map(int, input().split()))
	count = 0
	for i in range(n):
		if r[i] == d[i]:
			count += 1
	print(count)


for i in range(int(input())):
	n = int(input())
	arrs = list(map(int, input().split()))
	arrd = list(map(int, input().split()))
	e = 0
	for i in range(n):
		if arrs[i] == arrd[i]:
			e += 1
	print(e)


t = int(input())
for d in range(0, t):
	n = int(input())
	s = [int(x) for x in input().split(' ')]
	d = [int(x) for x in input().split(' ')]
	c = 0
	for i in range(0, n):
		if s[i] == d[i]:
			c = c + 1
	print(c)


for i in range(int(input())):
	x = int(input())
	y = list(map(int, input().split()))
	z = list(map(int, input().split()))
	j = 0
	count = 0
	while j < x:
		if y[j] == z[j]:
			count += 1
		j += 1
	print(count)


n = int(input())
for i in range(n):
	l = int(input())
	c = 0
	a = list(map(int, input().split()))
	b = list(map(int, input().split()))
	for i in range(l):
		if a[i] == b[i]:
			c += 1
	print(c)


t = int(input())
for _ in range(t):
	n = int(input())
	lis1 = list(map(int, input().split()))
	lis2 = list(map(int, input().split()))
	ans = 0
	for i in range(n):
		if lis1[i] == lis2[i]:
			ans += 1
	print(ans)


for i in range(int(input())):
	n = int(input())
	x = list(map(int, input().split()))
	y = list(map(int, input().split()))
	s = 0
	for i in range(n):
		if x[i] == y[i]:
			s += 1
		else:
			continue
	print(s)


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	arr1 = list(map(int, input().split()))
	count = 0
	for i in range(len(arr)):
		if arr[i] == arr1[i]:
			count = count + 1
	print(count)


t = int(input())
for _ in range(t):
	n = int(input())
	x = list(map(int, input().split()))
	y = list(map(int, input().split()))
	d = 0
	for i in range(n):
		if x[i] == y[i]:
			d += 1
	print(d)


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	b = list(map(int, input().split()))
	s = 0
	for i in range(n):
		if a[i] == b[i]:
			s = s + 1
	print(s)


t = int(input())
for i in range(t):
	n = int(input())
	s = list(map(int, input().split(' ')))
	d = list(map(int, input().split(' ')))
	x = 0
	for j in range(n):
		if s[j] == d[j]:
			x += 1
	print(x)


for i in range(int(input())):
	x = int(input())
	a1 = list(map(int, input().split()))
	a2 = list(map(int, input().split()))
	c = 0
	for i in range(x):
		if a1[i] == a2[i]:
			c += 1
	print(c)


for i in range(int(input())):
	a = int(input())
	s = [int(i) for i in input().split()]
	d = [int(i) for i in input().split()]
	count = 0
	for j in range(a):
		if s[j] == d[j]:
			count = count + 1
	print(count)


for _ in range(int(input())):
	N = int(input())
	l1 = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	count = 0
	for i in range(N):
		if l1[i] == l2[i]:
			count += 1
	print(count)


t = int(input())
for i in range(t):
	N = int(input())
	S = list(map(int, input().split()))
	D = list(map(int, input().split()))
	count = 0
	for i in range(0, N):
		if S[i] == D[i]:
			count = count + 1
	print(count)


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	count = 0
	for i in range(0, n):
		if l[i] == l2[i]:
			count = count + 1
	print(count)


tc = int(input())
for i in range(tc):
	n = int(input())
	list1 = list(map(int, input().split()))
	list2 = list(map(int, input().split()))
	counter = 0
	for i in range(len(list1)):
		if list1[i] == list2[i]:
			counter += 1
	print(counter)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l1 = list(map(int, input().split()))
	c = 0
	for i in range(n):
		if l[i] == l1[i]:
			c += 1
	print(c)


for i in range(int(input())):
	length = int(input())
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	ans = 0
	for j in range(length):
		if s[j] == d[j]:
			ans += 1
	print(ans)


T = int(input())
for i in range(T):
	N = int(input())
	S = list(map(int, input().split()))
	D = list(map(int, input().split()))
	equilibrium_count = 0
	for j in range(N):
		if S[j] == D[j]:
			equilibrium_count += 1
	print(equilibrium_count)


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	b = list(map(int, input().split()))
	count = 0
	for j in range(n):
		if a[j] == b[j]:
			count = count + 1
	print(count)


for i in range(int(input())):
	n = int(input())
	an = list(map(int, input().split()))
	ad = list(map(int, input().split()))
	c = 0
	for j in range(n):
		if an[j] == ad[j]:
			c = c + 1
	print(c)


a = int(input())
cnt = 0
for i in range(a):
	b = int(input())
	ar = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	for i in range(b):
		if ar[i] == arr[i]:
			cnt += 1
	print(cnt)
	cnt = 0


n = int(input())
for i in range(n):
	c = 0
	length = int(input())
	supply = input().split()
	demand = input().split()
	for j in range(length):
		if supply[j] == demand[j]:
			c += 1
	print(c)


for i in range(int(input())):
	n = int(input())
	l1 = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	count = 0
	for i in range(n):
		if l1[i] == l2[i]:
			count = count + 1
	print(count)


for i in range(int(input())):
	n = int(input())
	arr1 = list(map(int, input().split()))
	arr2 = list(map(int, input().split()))
	e = 0
	for i in range(n):
		if arr1[i] == arr2[i]:
			e += 1
	print(e)


t = int(input())
for i in range(t):
	n = int(input())
	supply = list(map(int, input().split()))
	demand = list(map(int, input().split()))
	count = 0
	for i in range(n):
		if supply[i] == demand[i]:
			count += 1
		else:
			count += 0
	print(count)


t = int(input())
for i in range(t):
	c = 0
	l = int(input())
	l1 = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	for i in range(l):
		if l1[i] == l2[i]:
			c += 1
	print(c)


for i in range(int(input())):
	a = int(input())
	l1 = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	c = 0
	for i in range(a):
		if l1[i] == l2[i]:
			c += 1
	print(c)


for _ in range(int(input())):
	a = int(input())
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	c = 0
	for i in range(a):
		if s[i] == d[i]:
			c += 1
	print(c)


for t in range(int(input())):
	n = int(input())
	k = list(map(int, input().split(' ')))
	m = list(map(int, input().split(' ')))
	b = 0
	for j in range(n):
		if k[j] == m[j]:
			b += 1
	print(b)


t = int(input())
for _ in range(t):
	n = int(input())
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	res = 0
	for i in range(len(s)):
		if s[i] == d[i]:
			res += 1
	print(res)


for t in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()]
	b = [int(i) for i in input().split()]
	c = 0
	for i in range(len(a)):
		if a[i] == b[i]:
			c = c + 1
	print(c)


for i in range(int(input())):
	t = int(input())
	a = 0
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	for i in range(t):
		if s[i] == d[i]:
			a += 1
	print(a)


for i in range(int(input())):
	x = int(input())
	a = list(map(int, input().split()))
	b = list(map(int, input().split()))
	p = 0
	i = 0
	while i < x:
		if a[i] == b[i]:
			p = p + 1
		i = i + 1
	print(p)


t = int(input())
while t > 0:
	t = t - 1
	l = 0
	a = int(input())
	s = list(input().split())
	r = list(input().split())
	for i in range(a):
		if s[i] == r[i]:
			l = l + 1
	print(l)


t = int(input())
for i in range(t):
	a = int(input())
	l1 = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	b = 0
	for j in range(len(l1)):
		if l1[j] == l2[j]:
			b += 1
	print(b)


T = int(input())
for _ in range(T):
	N = int(input())
	S = [int(i) for i in input().split()][0:N]
	D = [int(i) for i in input().split()][0:N]
	count = 0
	for i in range(len(S)):
		if S[i] == D[i]:
			count += 1
	print(count)


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	m = list(map(int, input().split()))
	k = 0
	for i in range(n):
		if l[i] == m[i]:
			k += 1
	print(k)


p = int(input())
for i in range(p):
	p = int(input())
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	count = 0
	for j in range(p):
		if s[j] == d[j]:
			count += 1
	print(count)


n = int(input())
for i in range(n):
	a = int(input())
	l = list(map(int, input().split()))
	l2 = list(map(int, input().split()))
	count = 0
	for j in range(len(l)):
		if l[j] == l2[j]:
			count += 1
	print(count)


for i in range(int(input())):
	n = int(input())
	s1 = list(map(int, input().split()))
	d1 = list(map(int, input().split()))
	e = 0
	for j in range(n):
		if s1[j] == d1[j]:
			e += 1
	print(e)


t = int(input())
for i in range(t):
	n = int(input())
	s = list(map(int, input().split()))
	d = list(map(int, input().split()))
	res = sum((x == y for (x, y) in zip(s, d)))
	print(str(res))


for _ in range(int(input())):
	n = int(input())
	count = 0
	dls = list(map(int, input().split(' ')))
	sls = list(map(int, input().split(' ')))
	for i in range(len(dls)):
		if dls[i] == sls[i]:
			count += 1
	print(count)