CF734F Anton and School

Description

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: ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF734F/bffe7b936d76e107bd6e7aac7baeb51f54bd3fd0.png) 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.

Input Format

The first line of the input contains a single integers $ n $ ( $ 1

Output Format

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.