## GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

# [Solution] Make A Equal to B Codeforces Solution

A. Make A Equal to B
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given two arrays $a$ and $b$ of $n$ elements, each element is either $0$ or $1$.

You can make operations of $2$ kinds.

• Pick an index $i$ and change ${a}_{i}$ to $1-{a}_{i}$.
• Rearrange the array $a$ however you want.

Find the minimum number of operations required to make $a$ equal to $b$.

Input

Each test contains multiple test cases. The first line contains a single integer $t$ ($1\le t\le 400$) — the number of test cases. Description of the test cases follows.

The first line of each test case contains a single integer $n$ ($1\le n\le 100$) — the length of the arrays $a$ and $b$.

The second line of each test case contains $n$ space-separated integers ${a}_{1},{a}_{2},\dots ,{a}_{n}$ (${a}_{i}$ is $0$ or $1$), representing the array $a$.

The third line of each test case contains $n$ space-separated integers ${b}_{1},{b}_{2},\dots ,{b}_{n}$ (${b}_{i}$ is $0$ or $1$), representing the array $b$.

Output

For each test case, print the minimum number of operations required to make $a$ equal to $b$.

Note

In the first case, we need only one operation: change ${a}_{1}$ to $1-{a}_{i}$. Now $a=\left[0,0,1\right]$ which is equal to $b$.

In the fourth case, the optimal way is to rearrange $a$ to get the array $\left[0,1,1,0\right]$.