Problem:
Score : 700 points

Problem Statement

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.

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.

Constraints

N is an integer.

1 \leq N \leq 10^{5}

Input

Input is given from Standard Input in the following format:

N

Output

If there exists a tree satisfying the condition in the statement, print Yes; otherwise, print No.
Then, if such a tree exists, print the 2N-1 edges of such a tree in the subsequent 2N-1 lines, in the following format:

a_{1} b_{1}
\vdots
a_{2N-1} b_{2N-1}

Here each pair (a_i, b_i) means that there is an edge connecting Vertex a_i and b_i. The edges may be printed in any order.

Sample Input 1

3

Sample Output 1

Yes
1 2
2 3
3 4
4 5
5 6

The sample output represents the following graph:

Sample Input 2

1

Sample Output 2

No

There is no tree satisfying the condition.

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Collections.Generic;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading;
using static System.Math;
using Debug = System.Diagnostics.Debug;
using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions;
using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute;


static class P
{
    static void Main()
    {
        var n = int.Parse(Console.ReadLine());
        if (n < 3 || n % 2 != 1)
        {
            Console.WriteLine("No");
            return;
        }
        List<Tuple<int, int>> res = new List<Tuple<int, int>>();
        res.Add(new Tuple<int, int>(1, 2));
        res.Add(new Tuple<int, int>(2, 3));
        res.Add(new Tuple<int, int>(3, 1 + n));
        res.Add(new Tuple<int, int>(1 + n, 2 + n));
        res.Add(new Tuple<int, int>(2 + n, 3 + n));
        for (int i = 4; i < n; i += 2)
        {
            res.Add(new Tuple<int, int>(i, i + 1));
            res.Add(new Tuple<int, int>(i + 1, 1));
            res.Add(new Tuple<int, int>(1, i + n));
            res.Add(new Tuple<int, int>(i + n, i + 1 + n));
        }
        Console.WriteLine("Yes");
        Console.WriteLine(string.Join("\n", res.Select(x => $"{x.Item1} {x.Item2}")));
    }
}