#include <bits/stdc++.h>
using namespace std;
const int MAX = 100000;
vector<int> g[MAX];
int k;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> k;
  if (k % 2 == 0)
    cout << "NO\n";
  else {
    if (k == 1) {
      cout << "YES\n";
      cout << "2 1\n";
      cout << "1 2\n";
      return 0;
    }
    cout << "YES\n";
    priority_queue<pair<int, int>, vector<pair<int, int>>,
                   greater<pair<int, int>>>
        q;
    q.push({1, 0});
    for (int i = 1; i < k + 2; i++) {
      q.push({0, i});
    }
    int edges = 0;
    while (q.size()) {
      int e = q.top().first;
      int m = q.top().second;
      q.pop();
      while (e < k) {
        pair<int, int> aux = q.top();
        q.pop();
        if (aux.first < k) {
          aux.first++;
          q.push(aux);
          g[m].push_back(aux.second);
          e++;
          edges++;
        }
      }
    }
    int n = k + 2;
    cout << 2 * n << " " << (edges * 2) + 1 << "\n";
    cout << "1 " << n + 1 << "\n";
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < g[i].size(); j++) {
        cout << i + 1 << " " << g[i][j] + 1 << "\n";
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < g[i].size(); j++) {
        cout << (i + 1) + n << " " << (g[i][j] + 1) + n << "\n";
      }
    }
  }
}
