#include <bits/stdc++.h>
using namespace std;
int ar[100005];
char ch[100005];
int n, m, ii, k;
void solve() {
  scanf("%d", &k);
  if (k % 2 == 0) {
    printf("NO\n");
    return;
  }
  printf("YES\n");
  if (k == 1) {
    printf("2 1\n1 2\n");
    return;
  }
  n = 2 * k + 4;
  m = (k * k) + (2 * k);
  printf("%d %d\n", n, m);
  for (int i = 1; i <= k; i++) {
    int j = i + 1;
    if (i % 2 == 0) j++;
    for (; j <= k; j++) printf("%d %d\n", i, j);
  }
  for (int i = 2; i <= k; i++) {
    printf("%d %d\n", i, k + 1);
    printf("%d %d\n", i, k + 2);
  }
  printf("%d %d\n", k + 1, k + 2);
  for (int i = 1; i <= k; i++) {
    int j = i + 1;
    if (i % 2 == 0) j++;
    for (; j <= k; j++) printf("%d %d\n", i + k + 2, j + k + 2);
  }
  for (int i = 2; i <= k; i++) {
    printf("%d %d\n", i + 2 + k, k + 1 + k + 2);
    printf("%d %d\n", i + 2 + k, k + 2 + k + 2);
  }
  printf("%d %d\n", k + 1 + k + 2, k + 2 + k + 2);
  printf("%d %d\n", 1, k + 3);
}
int main() {
  int t = 1;
  while (t--) solve();
  return 0;
}
