{"problem":{"name":"Even Sum Triplet","description":{"content":"You are given integer sequences of length $N$: $A=(A_1, A_2, \\dots, A_N)$ and $B=(B_1, B_2, \\dots, B_N)$. You may perform the following operation any number of times: *   Choose an integer $i\\ (1 \\le","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc155_c"},"statements":[{"statement_type":"Markdown","content":"You are given integer sequences of length $N$: $A=(A_1, A_2, \\dots, A_N)$ and $B=(B_1, B_2, \\dots, B_N)$.\nYou may perform the following operation any number of times:\n\n*   Choose an integer $i\\ (1 \\leq i \\leq N-2)$ such that $A_i+A_{i+1}+A_{i+2}$ is even. Then, rearrange $A_i$, $A_{i+1}$, $A_{i+2}$ as you like.\n\nDetermine whether it is possible to make $A$ equal $B$.\n\n## Constraints\n\n*   $3 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i, B_i \\leq 2 \\times 10^5$\n*   All values in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\dots$ $A_N$\n$B_1$ $B_2$ $\\dots$ $B_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc155_c","tags":[],"sample_group":[["5\n1 2 3 4 5\n3 1 2 4 5","Yes\n\n$A_1+A_2+A_3$ is $1+2+3=6$, which is even, so you can choose $i=1$.\nIf you choose $i=1$ and rearrange $A_1, A_2, A_3$ into $A_3, A_1, A_2$, then $A$ becomes $(3, 1, 2, 4, 5)$.\nNow $A$ equals $B$, so you should print `Yes`."],["5\n1 2 4 6 5\n5 1 4 2 6","No"],["9\n2 10 4 3 6 2 6 8 5\n2 4 10 3 8 6 6 2 5","Yes"]],"created_at":"2026-03-03 11:01:13"}}