B'Vika came to her favorite cosmetics store "Golden Pear". She noticed that the prices of n items have changed since her last visit. She decided to analyze how much the prices have changed and calculated the difference between the old and new prices for each of the n items. Vika enjoyed calculating the price differences and decided to continue this process. Let the old prices be represented as an array of non-negative integers a , and the new prices as an array of non-negative integers b . Both arrays have the same length n . In one operation, Vika constructs a new array c according to the following principle: c_i = |a_i - b_i| . Then, array c renamed into array b , and array b renamed into array a at the same time, after which Vika repeats the operation with them. For example, if a = [1, 2, 3, 4, 5, 6, 7] ; b = [7, 6, 5, 4, 3, 2, 1] , then c = [6, 4, 2, 0, 2, 4, 6] . Then, a = [7, 6, 5, 4, 3, 2, 1] ; b = [6, 4, 2, 0, 2, 4, 6] . Vika decided to call a pair of arrays a , b dull if after some number of such operations all elements of array a become zeros. Output "YES" if the original pair of arrays is dull, and "NO" otherwise. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains a single integer n ( 1 <= n <= 10^5 ) -- the number of items whose prices have changed. The second line contains n integers a_1, a_2, ldots, a_n ( 0 <= a_i <= 10^9 ) -- the old prices of the items. The third line contains n integers b_1, b_2, ldots, b_n ( 0 <= b_i <= 10^9 ) -- the new prices of the items. It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case, output "YES" if the pair of price arrays '...