#include <bits/stdc++.h>
const int maxn = 1005000;
int k;
int n, m;
int l[maxn], r[maxn];
int d[maxn];
int main() {
  scanf("%d", &k);
  if (!(k & 1)) {
    puts("NO");
    return 0;
  }
  n = 2 * k - 1;
  m = 0;
  for (int i = 2; i <= k; ++i) {
    ++m;
    l[m] = i;
    r[m] = 1;
    ++d[i];
    ++d[1];
    for (int j = k + 1; j <= n; ++j) {
      ++m;
      l[m] = i;
      r[m] = j;
      ++d[i];
      ++d[j];
    }
  }
  for (int i = k + 1; i < n; i += 2) {
    ++m;
    l[m] = i;
    r[m] = i + 1;
    ++d[i];
    ++d[i + 1];
  }
  printf("YES\n%d %d\n", n * 2, m * 2 + 1);
  for (int i = 1; i <= m; ++i)
    printf("%d %d\n%d %d\n", l[i], r[i], l[i] + n, r[i] + n);
  printf("%d %d\n", 1, n + 1);
  return 0;
}
