#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > q;
int main() {
  int n, m, k;
  scanf("%d", &k);
  if (k % 2 == 0) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  if (k == 1) {
    printf("2 1\n");
    printf("1 2\n");
    return 0;
  }
  int res = k + 2;
  for (int i = 2; i <= k; i++) {
    q.push_back(make_pair(1, i));
    q.push_back(make_pair(1 + res, i + res));
    for (int j = i + 1; j <= k; j++) {
      if (j == i + 1 && i % 2 == 1 || j > i + 1) {
        q.push_back(make_pair(i, j));
        q.push_back(make_pair(i + res, j + res));
      }
    }
    q.push_back(make_pair(i, k + 1));
    q.push_back(make_pair(i, k + 2));
    q.push_back(make_pair(i + res, k + 1 + res));
    q.push_back(make_pair(i + res, k + 2 + res));
  }
  q.push_back(make_pair(k + 1, k + 2));
  q.push_back(make_pair(k + 1 + res, k + 2 + res));
  q.push_back(make_pair(k + 3, 1));
  int L = q.size();
  printf("%d %d\n", k + 2 + k + 2, L);
  for (int i = 0; i < L; i++) printf("%d %d\n", q[i].first, q[i].second);
  return 0;
}
