The Hamming distance dH( ⃗v, ⃗u) between two n-dimensional vectors ⃗v = (v₁, . . . , v_n) and ⃗u =(u₁, . . . , u_n) is defined as dH( ⃗v, ⃗u) = |{i : v_{i ≠} u_i and i ∈ {1, . . . , n}}|, i.e., the number of positions at which the corresponding entries are different. For example, the Hamming distance between (1, 2, 3, 4, 5) and (1, 0, 0, 4, 5) is 2, since these two vectors differ only at the second and the third positions. Please write a program to compute the Hamming distance between two n-dimensional vectors.

입력 형식

On the first line there is a single integer T (T ≤ 100) indicating the number of test cases. Each test case consists of three lines. The first line of each test case contains an integer n (0 < n ≤ 50) indicating the dimension of the vectors. The second line contains n integers v₁, . . . , v_n, and the third line contains n integers u₁, . . . , u_n. You may assume that v₁, . . . , v_n, u₁, . . . , u_n ∈ {0, 1, . . . , 99}.

출력 형식

For each test case, output the Hamming distance between (v₁, . . . , v_n) and (u₁, . . . , u_n).

예제 입력

2
3
1 2 3
3 2 1
4
1 0 1 0
1 0 1 1

예제 출력

2
1