{"raw_statement":[{"iden":"problem statement","content":"You are given two sequences, each of length $N$, consisting of non-negative integers: $A=(A_1,A_2,\\ldots,A_{N})$ and $B=(B_1,B_2,\\ldots,B_{N})$.\nDetermine whether it is possible to make $A$ equal to $B$ by performing the operation below at most $70000$ times. If it is possible, present a specific sequence of operations that achieves it.\n\n*   Choose an integer $K\\ (1\\le K \\le N)$. For every integer $i\\ (2\\leq i \\leq K)$, simultaneously replace the value of $A_i$ with $A_{i-1} \\oplus A_i$.\n\nHere, $\\oplus$ denotes bitwise $\\mathrm{XOR}$.\nWhat is bitwise $\\mathrm{XOR}$?The bitwise $\\mathrm{XOR}$ of non-negative integers $A$ and $B$, $A\\oplus B$, is defined as follows:\n\n*   When $A\\oplus B$ is written in base two, the digit in the $2^k$'s place ($k \\geq 0$) is $1$ if exactly one of the digits in that place of $A$ and $B$ are $1$, and $0$ otherwise.\n\nFor example, $3\\oplus 5 = 6$ (in base two: $011\\oplus 101 = 110$)."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 1000$\n*   $0 \\leq A_i, B_i < 2^{60}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n$B_1$ $B_2$ $\\ldots$ $B_N$"},{"iden":"sample input 1","content":"3\n1 2 0\n1 2 3"},{"iden":"sample output 1","content":"Yes\n2\n2 3\n\nIn this output, the sequence $A$ is changed as follows:\n\n*   Initially: $A=(1, 2, 0)$.\n*   After the $1$\\-st operation: $A=(1, 3, 0)$.\n*   After the $2$\\-nd operation: $A=(1, 2, 3)$.\n\nAfter the two operations, $A$ and $B$ are equal, achieving the objective."},{"iden":"sample input 2","content":"2\n10 100\n1 0"},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"2\n1152921504606846975 0\n1152921504606846975 0"},{"iden":"sample output 3","content":"Yes\n0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}