{"problem":{"name":"Simultaneous Swap","description":{"content":"You are given two sequences of $N$ numbers: $A=(A_1,A_2,\\ldots,A_N)$ and $B=(B_1,B_2,\\ldots,B_N)$. Takahashi can repeat the following operation any number of times (possibly zero). > Choose three pai","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc296_f"},"statements":[{"statement_type":"Markdown","content":"You are given two sequences of $N$ numbers: $A=(A_1,A_2,\\ldots,A_N)$ and $B=(B_1,B_2,\\ldots,B_N)$.\nTakahashi can repeat the following operation any number of times (possibly zero).\n\n> Choose three pairwise distinct integers $i$, $j$, and $k$ between $1$ and $N$.  \n> Swap the $i$\\-th and $j$\\-th elements of $A$, and swap the $i$\\-th and $k$\\-th elements of $B$.\n\nIf there is a way for Takahashi to repeat the operation to make $A$ and $B$ equal, print `Yes`; otherwise, print `No`.  \nHere, $A$ and $B$ are said to be equal when, for every $1\\leq i\\leq N$, the $i$\\-th element of $A$ and that of $B$ are equal.\n\n## Constraints\n\n*   $3 \\leq N \\leq 2\\times 10^5$\n*   $1\\leq A_i,B_i\\leq N$\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$ $\\ldots$ $A_N$\n$B_1$ $B_2$ $\\ldots$ $B_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc296_f","tags":[],"sample_group":[["3\n1 2 1\n1 1 2","Yes\n\nPerforming the operation once with $(i,j,k)=(1,2,3)$ swaps $A_1$ and $A_2$, and swaps $B_1$ and $B_3$,  \nmaking both $A$ and $B$ equal to $(2,1,1)$. Thus, you should print `Yes`."],["3\n1 2 2\n1 1 2","No\n\nThere is no way to perform the operation to make $A$ and $B$ equal, so you should print `No`."],["5\n1 2 3 2 1\n3 2 2 1 1","Yes"],["8\n1 2 3 4 5 6 7 8\n7 8 5 6 4 3 1 2","No"]],"created_at":"2026-03-03 11:01:14"}}