{"raw_statement":[{"iden":"problem statement","content":"You are given an integer $N$. Determine if there exists a tree with $2N$ vertices numbered $1$ to $2N$ satisfying the following condition, and show one such tree if the answer is yes.\n\n*   Assume that, for each integer $i$ between $1$ and $N$ (inclusive), Vertex $i$ and $N+i$ have the weight $i$. Then, for each integer $i$ between $1$ and $N$, the bitwise XOR of the weights of the vertices on the path between Vertex $i$ and $N+i$ (including themselves) is $i$."},{"iden":"constraints","content":"*   $N$ is an integer.\n*   $1 \\leq N \\leq 10^{5}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"3"},{"iden":"sample output 1","content":"Yes\n1 2\n2 3\n3 4\n4 5\n5 6\n\n*   The sample output represents the following graph:\n    \n    ![image](https://img.atcoder.jp/agc035/d004b05438497d50637b534e89f7a511.png)"},{"iden":"sample input 2","content":"1"},{"iden":"sample output 2","content":"No\n\n*   There is no tree satisfying the condition."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}