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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef vector<pll> vpll;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back

inline void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void){
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value == hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value < hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value > hoge2.value;
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

bool power_of_two(ll N){
  if(N==2) return true;
  if(N%2==0) return power_of_two(N/2);
  return false;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N;
  IN(N);

  if(N==1 || N==2){
    OUT("No");
    return 0;
  }

  if(power_of_two(N)){
    OUT("No");
    return 0;
  }

  /*
  ll tmp = 0;
  ll bor = 0;
  REP(i,N){
    bor ^= (i+1);
    if(bor==0) tmp = i+1;
  }
  */

  ll tmp = 1;
  while(tmp*2 <= N+1) tmp*=2;
  tmp--;

  vb flags(tmp+1, true);
  vll ans;
  ll hoge = (N^(N-1));
  ll tmptmp = 1;
  ll tmptmp_last = 1;
  while(tmptmp<=hoge){
    if((tmptmp&hoge)!=0){
      ans.push_back(tmptmp);
      flags[tmptmp] = false;
      tmptmp_last = tmptmp;
    }
    tmptmp*=2;
  }

  REP(i,tmp){
    if(flags[i+1]) ans.push_back(i+1);
  }

  OUT("Yes");
  REP(i, tmp-1){
    OUT(ans[i], ans[i+1]);
    OUT(ans[i]+N, ans[i+1]+N);
  }
  OUT(ans[tmp-1], 1+N);

  tmp++;
  while(tmp+1<=N){
    OUT(tmp, tmp+1);
    OUT(tmp+N, tmp+1+N);
    OUT(tmp+1, 1);
    OUT(1, tmp+N);
    tmp+=2;
  }

  if(N%2==0){
    OUT(N, N-1);
    OUT(tmptmp_last, 2*N);
  }

  return 0;
}

Measured memory_bytes: 3448