#include <bits/stdc++.h>
using namespace std;
long long GCD(long long u, long long v) {
  while (v != 0) {
    long long r = u % v;
    u = v;
    v = r;
  }
  return u;
};
double lng(double a, double b, double c, double d) {
  double s;
  s = sqrt((a - c) * (a - c) + (b - d) * (b - d));
  return s;
};
struct name {
  int x, y;
};
bool comp(name a, name b) { return a.x < b.x; };
int n, ans, k, t;
int a[1000][1000] = {0};
int main() {
  scanf("%d", &k);
  if (k % 2 == 0) {
    printf("NO\n");
    return 0;
  }
  if (k == 1) {
    printf("YES\n2 1\n1 2");
    return 0;
  }
  printf("YES\n");
  for (int i = 0; i < k + 1; ++i) {
    for (int j = 0; j < k + 1; ++j) {
      if (i == j) {
        continue;
      }
      a[i + 1][j + 1] = 1;
    }
  }
  for (int i = k + 2; i < 2 * k + 3; ++i) {
    for (int j = k + 2; j < 2 * k + 3; ++j) {
      if (i == j) {
        continue;
      }
      a[i + 1][j + 1] = 1;
    }
  }
  t = k - 1;
  for (int i = 0; i < k + 1; ++i) {
    for (int j = 0; j < k + 1; ++j) {
      if (i == j) {
        continue;
      }
      if (a[i + 1][j + 1] == 0) continue;
      if (t == 0) break;
      if (a[i + 1][k + 2] == 1 || a[j + 1][k + 2] == 1) continue;
      a[i + 1][k + 2] = a[k + 2][i + 1] = a[j + 1][k + 2] = a[k + 2][j + 1] = 1;
      a[i + 1][j + 1] = a[j + 1][i + 1] = 0;
      t -= 2;
    }
    if (t == 0) break;
  }
  t = k - 1;
  for (int i = k + 2; i < 2 * k + 3; ++i) {
    for (int j = k + 2; j < 2 * k + 3; ++j) {
      if (i == j) {
        continue;
      }
      if (a[i + 1][j + 1] == 0) continue;
      if (t == 0) break;
      if (a[i + 1][2 * k + 4] == 1 || a[j + 1][2 * k + 4] == 1) continue;
      a[i + 1][2 * k + 4] = a[2 * k + 4][i + 1] = a[j + 1][2 * k + 4] =
          a[2 * k + 4][j + 1] = 1;
      a[i + 1][j + 1] = a[j + 1][i + 1] = 0;
      t -= 2;
    }
    if (t == 0) break;
  }
  a[k + 2][2 * k + 4] = 1;
  printf("%d %d\n", 2 * k + 4, (k + 2) * k);
  for (int i = 0; i < 2 * k + 5; ++i) {
    for (int j = 0; j < 2 * k + 5; ++j) {
      if (a[i + 1][j + 1] == 1) {
        a[j + 1][i + 1] = a[i + 1][j + 1] = 0;
        printf("%d %d\n", i + 1, j + 1);
      }
    }
  }
  return 0;
}
