#include <bits/stdc++.h>
using namespace std;

// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second

#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;

template<typename T> void ckmin(T& a, const T& b) { a = min(a, b); }
template<typename T> void ckmax(T& a, const T& b) { a = max(a, b); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

namespace __input {
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }

    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace __input;

namespace __output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }

    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps();
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...);
    }
}
using namespace __output;

#define TRACE(x) x
#define __pn(x) pr(#x, " = ")
#define pd(...) __pn((__VA_ARGS__)), ps(__VA_ARGS__)

namespace __io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0);
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); }
    }
}
using namespace __io;
// }}}

int main() {
    setIO();

    int N; re(N);

    if (__builtin_popcount(N) == 1) {
        ps("No");
        return 0;
    }

    int every = 0;
    F0R (v, N + 1) every ^= v;

    if (every == 0) {
        ps("Yes");
        F0R (i, 2 * N - 1)
            ps(i+1, i+2);
        return 0;
    }

    assert(every == 1 || every == N || every == N + 1);

    vi need, rest;

    FOR (v, 1, N + 1) {
        if (v == 1 && (every == 1 || every == N + 1)) continue;
        if (v == N && (every == N || every == N + 1)) continue;
        if (every > 1 && __builtin_popcount(v) == 1 && (N & v)) need.pb(v);
        else rest.pb(v);
    }

    if (every == 1) {
        ps("Yes");
        F0R (i, sz(rest) - 1) {
            ps(rest[i], rest[i+1]);
            ps(N + rest[i], N + rest[i+1]);
        }
        ps(rest.back(), N + rest.front());
        ps(1, 2);
        ps(3, N + 1);
        return 0;
    }

    reverse(all(need));
    vi comb = need;
    comb.insert(comb.end(), all(rest));

    int rr = 0; trav (v, comb) rr ^= v; assert(!rr);

    int made = 0; trav (v, need) made |= v;
    if (every == N) {
        ps("Yes");
        F0R (i, sz(comb) - 1) {
            ps(comb[i], comb[i+1]);
            ps(N + comb[i], N + comb[i+1]);
        }
        ps(comb.back(), N + comb.front());
        ps(N, need.front());
        ps(need.back(), 2 * N);
        return 0;
    } else {
        ps("Yes");
        F0R (i, sz(comb) - 1) {
            ps(comb[i], comb[i+1]);
            ps(N + comb[i], N + comb[i+1]);
        }
        ps(comb.back(), N + comb.front());

        ps(N, need.front());
        ps(need.back(), 2 * N);

        ps(1, 2);
        ps(3, N + 1);

        return 0;
    }

    return 0;
}




Measured memory_bytes: 3704