Hamming Distance

The Hamming distance $d_H(\vec{v}, \vec{u})$ between two $n$-dimensional vectors $\vec{v} = (v_1, \ldots, v_n)$ and $\vec{u} = (u_1, \ldots, u_n)$ is the number of positions at which the corresponding entries differ.

$d_H(\vec{v}, \vec{u}) = |\{\, i : v_i \neq u_i,\; i \in \{1, \ldots, n\} \,\}|$

For example, the Hamming distance between $(1, 2, 3, 4, 5)$ and $(1, 0, 0, 4, 5)$ is $2$. The two vectors differ only at the second position and the third position.

Write a program that computes the Hamming distance between two $n$-dimensional vectors.

The first line contains the number of test cases $T$. ($T \le 100$)

Each test case consists of three lines. The first line contains the dimension $n$ of the vectors. ($0 < n \le 50$) The second line contains $v_1, \ldots, v_n$ and the third line contains $u_1, \ldots, u_n$, separated by spaces. Every entry is an integer between $0$ and $99$, inclusive.

For each test case, print the Hamming distance between $(v_1, \ldots, v_n)$ and $(u_1, \ldots, u_n)$, one per line.