[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$0$ or 1$1$.

You can make operations of 2$2$ kinds.

• Pick an index 𝑖$i$ and change 𝑎𝑖$a_i$ to 1−𝑎𝑖$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≤𝑡≤400$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≤𝑛≤100$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 𝑎1,𝑎2,…,𝑎𝑛$a_1,a_2,\dots ,a_n$ (𝑎𝑖$a_i$ is 0$0$ or 1$1$), representing the array 𝑎$a$.

The third line of each test case contains 𝑛$n$ space-separated integers 𝑏1,𝑏2,…,𝑏𝑛$b_1,b_2,\dots ,b_n$ (𝑏𝑖$b_i$ is 0$0$ or 1$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 𝑎1$a_1$ to 1−𝑎𝑖$1-a_i$. Now 𝑎=[0,0,1]$a=[0,0,1]$ which is equal to 𝑏$b$.

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