Menorah

 There are 

n$n$ candles on a Hanukkah menorah, and some of its candles are initially lit. We can describe which candles are lit with a binary string s$s$, where the i$i$-th candle is lit if and only if si=1$s_i=1$.

Initially, the candle lights are described by a string a$a$. In an operation, you select a candle that is currently lit. By doing so, the candle you selected will remain lit, and every other candle will change (if it was lit, it will become unlit and if it was unlit, it will become lit).

You would like to make the candles look the same as string b$b$. Your task is to determine if it is possible, and if it is, find the minimum number of operations required.

Input

The first line contains an integer t$t$ (1≤t≤104$1\le t\le {10}^4$) — the number of test cases. Then t$t$ cases follow.

The first line of each test case contains a single integer n$n$ (1≤n≤105$1\le n\le {10}^5$) — the number of candles.

The second line contains a string a$a$ of length n$n$ consisting of symbols 0 and 1 — the initial pattern of lights.

The third line contains a string b$b$ of length n$n$ consisting of symbols 0 and 1 — the desired pattern of lights.

It is guaranteed that the sum of n$n$ does not exceed 105${10}^5$.

Output

For each test case, output the minimum number of operations required to transform a$a$ to b$b$, or −1$-1$ if it's impossible.

Example

input

Copy

5
5
11010
11010
2
01
11
3
000
101
9
100010111
101101100
9
001011011
011010101

output

Copy

0
1
-1
3
4

• Tweet
• Share
• Share
• Share
• Share

Related Post