#include <bits/stdc++.h>
using namespace std;
vector<int> adj[107];
int adjmat[107][107];
int k;
int n = 0, m = 0;
void solve() {
  for (int i = 1; i <= k + 1; i++) {
    for (int j = 1; j <= k + 1; j++) {
      if (j != i && adjmat[i][j] != 1) {
        adj[i].push_back(j);
        adj[j].push_back(i);
        adjmat[i][j] = 1;
        adjmat[j][i] = 1;
        m++;
      }
    }
  }
  int i = 1;
  while (adj[k + 2].size() != k - 1) {
    adjmat[i][i + 1] = 0;
    adjmat[i + 1][i] = 0;
    adjmat[i][k + 2] = 1;
    adjmat[k + 2][i] = 1;
    adjmat[i + 1][k + 2] = 1;
    adjmat[k + 2][i + 1] = 1;
    adj[k + 2].push_back(i + 1);
    adj[k + 2].push_back(i);
    i += 2;
    m++;
  }
}
int main() {
  cin >> k;
  if (k != 1)
    n = ((k + 1) * 2) + 2;
  else
    n = 2;
  if (k % 2 == 0) {
    cout << "NO";
    return 0;
  }
  solve();
  cout << "YES" << '\n';
  if (k != 1)
    m = (m * 2) + 1;
  else
    m = 1;
  cout << n << ' ' << m << '\n';
  for (int i = 1; i <= k + 2; i++) {
    for (int j : adj[i]) {
      if (adjmat[i][j] == 1) {
        cout << i << ' ' << j << '\n';
        if (k != 1) cout << i + (k + 2) << ' ' << j + (k + 2) << '\n';
        adjmat[j][i] = 0;
      }
    }
  }
  if (k != 1) cout << k + 2 << ' ' << (2 * (k + 1) + 2) << '\n';
  return 0;
}
