#include <bits/stdc++.h>
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

int n;

int main() {
    scanf("%d",&n);
    if (n==(n&-n)) {
        puts("No");
        return 0;
    }
    puts("Yes");
    for (int i=2;i<n;i+=2) {
        printf("%d %d\n%d %d\n%d %d\n%d %d\n",i,1,i+1,1,i+n+1,i,i+1,i+n);
    }
    printf("%d %d\n",1+n,3+n);
    if (n%2==0) {
        int cnt = 1;
        while (cnt<n) cnt*=2;
        cnt/=2;
        printf("%d %d\n%d %d\n",n,cnt,n+n,(n^cnt^1));
    }

    return 0;
}
