SOLVE
LATER
Monk was having a great time in the Digital World, and was surprised to see a new game called, "Conversion Game". In this game, two arrays of $$N$$ integers $$A_{1}, A_{2}...A_{N}$$ and $$B_{1},B_{2}...B_{N}$$ are playing against each other and Array $$A$$ wants to convert itself in Array $$B$$.
Array $$A$$ can do two types of operations on itslef:
1 Take two adjacent elements A_{i} and A_{i+1} , increase A_{i} by 1 and decrease A_{i+1} by 1.
2 Take two adjacent elements A_{i} and A_{i+1} , decrease A_{i} by 1 and increase A_{i+1} by 1.
Monk being an awesome coder, wants to know whether Array $$A$$ can convert itself into Array $$B$$, by using any number of such operations. You have to print "YES" (without quotes), if Array $$A$$ can convert itself into array $$B$$, else print "NO" (without quotes).
INPUT:
First line of input will consists of integer $$T$$ denoting total number of test cases. Each test case will begin with integer $$N$$. Next line will consists of $$N$$ integers $$A_{1}, A_{2}...A_{N}$$. Next line will consists of $$N$$ integers $$B_{1},B_{2}...B_{N}$$.
OUTPUT:
Print "YES" (without quotes), if Array $$A$$ can convert itself into array $$B$$ by using any number of operations, else print "NO" (without quotes).
CONSTRAINTS:
1 ≤ T ≤ 10
1 ≤ N ≤ 1000
1 ≤ A_{i}, B_{i} ≤ 10^{6}
In the first test case, you can arrive at the second sequence using operations on first sequence.