Anton and School

你需要帮助 $\tt{Anton}$ 解决以下问题。 有 $n$ 个数构成数组 $a_i$。 另外有两个数组 $b,c$ 满足 $b_i=\sum\limits_{k=1}^{n}a_i \operatorname{bitand} a_k$，$c_i=\sum\limits_{k=1}^{n}a_i \operatorname{bitor} a_k$ 告诉你数组 $b,c$，请你找到满足条件的任意一个数组 $a$。如果找不到，输出 $-1$。 $1\le n \le 2\times 10^5,0\le b_i,c_i\le 10^9$

Anton goes to school, his favorite lessons are arraystudying. He usually solves all the tasks pretty fast, but this time the teacher gave him a complicated one: given two arrays $ b $ and $ c $ of length $ n $ , find array $ a $ , such that:  where $ a and b $ means bitwise AND, while $ a or b $ means bitwise OR. Usually Anton is good in arraystudying, but this problem is too hard, so Anton asks you to help.

The first line of the input contains a single integers $ n $ ( $ 1<=n<=200000 $ ) — the size of arrays $ b $ and $ c $ . The second line contains $ n $ integers $ b_{i} $ ( $ 0<=b_{i}<=10^{9} $ ) — elements of the array $ b $ . Third line contains $ n $ integers $ c_{i} $ ( $ 0<=c_{i}<=10^{9} $ ) — elements of the array $ c $ .

If there is no solution, print $ -1 $ . Otherwise, the only line of the output should contain $ n $ non-negative integers $ a_{i} $ — elements of the array $ a $ . If there are multiple possible solutions, you may print any of them.

4
6 8 4 4
16 22 10 10

3 5 1 1 

5
8 25 14 7 16
19 6 9 4 25

-1