{"raw_statement":[{"iden":"problem statement","content":"Given are two integer sequences of $N$ elements each: $A_1,...,A_N$ and $B_1,...,B_N$. Determine if it is possible to do the following operation at most $N-2$ times (possibly zero) so that, for every integer $i$ from $1$ to $N$, $A_i \\leq B_i$ holds:\n\n*   Choose two distinct integers $x$ and $y$ between $1$ and $N$ (inclusive), and swap the values of $A_x$ and $A_y$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 10^5$\n*   $1 \\leq A_i,B_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n$B_1$ $B_2$ $...$ $B_N$"},{"iden":"sample input 1","content":"3\n1 3 2\n1 2 3"},{"iden":"sample output 1","content":"Yes\n\nWe should swap the values of $A_2$ and $A_3$."},{"iden":"sample input 2","content":"3\n1 2 3\n2 2 2"},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"6\n3 1 2 6 3 4\n2 2 8 3 4 3"},{"iden":"sample output 3","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}