#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, M;
vector<Int> X, Y;
vector<int> A, B;

void ae(int u, int v) {
  ++M;
  A.push_back(u);
  B.push_back(v);
}

int main() {
  for (; ~scanf("%d", &N); ) {
    X.assign(N, 0);
    Y.assign(N, 0);
    M = 0;
    A.clear();
    B.clear();
    if (N <= 4) {
      for (int u = 0; u < N; ++u) {
        X[u] = 0;
        Y[u] = u;
      }
    } else if (N % 2 == 0 && N >= 8) {
      /*
        N=8
           3   
           6   
        -63|36-
           6   
           3   
        
        N=10
           |   
           6   
           6   
        363|363
           6   
           6   
           |   
        
        N=12
            3    
            6    
            6    
        -663|366-
            6    
            6    
            3    
      */
      constexpr int DX[4] = {+1, -1, 0, 0};
      constexpr int DY[4] = {0, 0, +1, -1};
      for (int u = 0; u < N; ++u) {
        X[u] = (u / 4 + 1) * DX[u % 4];
        Y[u] = (u / 4 + 1) * DY[u % 4];
      }
      ae(2, 0);
      ae(2, 1);
      ae(3, 0);
      ae(3, 1);
      ae(2, 3);
      ae(N - 4, N - 3);
      for (int u = 4; u < N; u += 2) {
        ae(u, u - 4);
        ae(u, u - 2);
        ae(u, u - 1);
        ae(u + 1, u - 3);
        ae(u + 1, u - 2);
        ae(u + 1, u - 1);
      }
      const Int big = ((N - 1) / 4 + 1) + 1;
      if (N % 4 != 0) {
        const Int dx = big, dy = big + 1;
        for (int u = 0; u < N; ++u) {
          if (Y[u] > 0) {
            const Int t = Y[u] - 1;
            X[u] = t * dx;
            Y[u] = t * dy + 1;
          }
          if (Y[u] < 0) {
            const Int t = -Y[u] - 1;
            X[u] = t * dx;
            Y[u] = t * -dy - 1;
          }
        }
      } else {
        for (int u = 0; u < N; ++u) {
          Y[u] += big * abs(X[u]);
        }
      }
    } else {
      puts("No");
      continue;
    }
    
    puts("Yes");
    for (int u = 0; u < N; ++u) {
      printf("%lld %lld\n", X[u], Y[u]);
    }
    printf("%d\n", M);
    for (int i = 0; i < M; ++i) {
      printf("%d %d\n", A[i] + 1, B[i] + 1);
    }
#ifdef LOCAL
cerr<<"N = "<<N<<endl;
vector<int>deg(N,0);for(int i=0;i<M;++i){++deg[A[i]];++deg[B[i]];}cerr<<"deg = "<<deg<<endl;
puts("[DOT]");for(int u=0;u<N;++u)printf("%lld %lld\n",X[u],Y[u]);
puts("[LINE_SEGMENT]");for(int i=0;i<M;++i)printf("%lld %lld %lld %lld\n",X[A[i]],Y[A[i]],X[B[i]],Y[B[i]]);
puts("========");
#endif
  }
  return 0;
}