//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

struct Scanner {
    FILE* fp = nullptr;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += fread(line + ed, 1, (1 << 15) - ed, fp);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char('0' + (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

// bit op
int popcnt(uint x) { return __builtin_popcount(x); }
int popcnt(ull x) { return __builtin_popcountll(x); }
int bsr(uint x) { return 31 - __builtin_clz(x); }
int bsr(ull x) { return 63 - __builtin_clzll(x); }
int bsf(uint x) { return __builtin_ctz(x); }
int bsf(ull x) { return __builtin_ctzll(x); }
Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

using P = pair<int, int>;

V<array<P, 2>> solve(int n) {
    V<array<P, 2>> res;
    if (n % 4 == 0 || n % 4 == 1) {
        res = solve(n - 2);
        int z = (n - 1) ^ n;
        // (n) - (n-1) - z - (n) - (n-1)
        res.push_back({{{n, 0}, {n - 1, 0}}});
        res.push_back({{{n - 1, 0}, {z, 0}}});
        res.push_back({{{z, 0}, {n, 1}}});
        res.push_back({{{n, 1}, {n - 1, 1}}});
        return res;
    }
    if (n % 4 == 2) {
        res = solve(n - 3);
        //           n
        //           |
        // (n-2) - (n-1) - 1 - (n-2) - (n-1)
        //                 |
        //                 2 - (n)
        res.push_back({{{n - 2, 0}, {n - 1, 0}}});
        res.push_back({{{n - 1, 0}, {1, 0}}});
        res.push_back({{{1, 0}, {n - 2, 1}}});
        res.push_back({{{n - 2, 1}, {n - 1, 1}}});

        res.push_back({{{n, 0}, {n - 1, 0}}});
        res.push_back({{{2, 0}, {n, 1}}});
        return res;
    }
    // naive
    V<P> path;
    for (int i = 0; i < n; i += 4) {
        for (int ph = 0; ph < 2; ph++) {
            for (int j = i; j < i + 4; j++) {
                if (j == 0) continue;
                path.push_back({j, ph});
            }
        }
    }
    int k = int(path.size());
    for (int i = 0; i < k - 1; i++) {
        res.push_back({{path[i], path[i + 1]}});
    }
    return res;
}

int main() {
    int n;
    sc.read(n);

    if (n == 1 << bsf(uint(n))) {
        pr.writeln("No");
        return 0;
    }

    pr.writeln("Yes");
    auto res = solve(n);
    for (auto p: res) {
        int id0 = p[0].first + n * p[0].second;
        int id1 = p[1].first + n * p[1].second;
        pr.writeln(id0, id1);
    }

    return 0;
}


Measured memory_bytes: 7664