{"raw_statement":[{"iden":"problem statement","content":"You are given length-$N$ integer sequences $A=(A_1,A_2,\\dots,A_N)$ and $B=(B_1,B_2,\\dots,B_N)$, each consisting of $0$ and $1$. Let $A[i,j]$ denote the consecutive subsequence of $A$ from the $i$\\-th through the $j$\\-th element. If $i>j$, then $A[i,j]$ is a length-$0$ sequence. You can perform the following operation on $A$ any number of times:\n\n*   Choose four integers $a,b,c,d$ that satisfy the following two conditions:\n    *   $1 \\leq a \\leq b < c \\leq d \\leq N$\n    *   $\\sum_{i=a}^{b}{A_i}=\\sum_{i=c}^{d}{A_i}$\n*   Swap $A[a,b]$ and $A[c,d]$. More precisely, replace $A$ with the sequence formed by concatenating $A[1,a-1]$, $A[c,d]$, $A[b+1,c-1]$, $A[a,b]$, $A[d+1,N]$ in this order.\n\nDetermine whether $A$ can be made to match $B$.\nSolve $T$ test cases for each input file."},{"iden":"constraints","content":"*   $1 \\leq T \\leq 10^5$\n*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $0 \\leq A_i \\leq 1$\n*   $0 \\leq B_i \\leq 1$\n*   The sum of $N$ over all test cases is at most $2\\times 10^5$.\n*   All input values are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$T$\n$case_1$\n$case_2$\n$\\vdots$\n$case_T$\n\nEach case is given in the following format:\n\n$N$\n$A_1$ $A_2$ $\\dots$ $A_N$\n$B_1$ $B_2$ $\\dots$ $B_N$"},{"iden":"sample input 1","content":"3\n6\n1 1 1 0 0 1\n0 1 1 0 1 1\n2\n0 0\n1 0\n3\n1 1 1\n1 1 1"},{"iden":"sample output 1","content":"Yes\nNo\nYes\n\nIn the first test case, $A$ is initially $(1,1,1,0,0,1)$.  \nBy choosing $(a,b,c,d)=(1,2,3,6)$ and performing the operation, $A$ becomes $(1,0,0,1,1,1)$.  \nNext, by choosing $(a,b,c,d)=(1,2,3,4)$ and performing the operation, $A$ becomes $(0,1,1,0,1,1)$, which matches $B$.  \nIn the second test case, $A$ cannot be made to match $B$.  \nIn the third test case, $A$ already matches $B$ from the beginning."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}