#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int MAXK = 1e5 + 3;
const int Candy = 1e7;
const int mod = 998244353;
const long long inf = 1ll << 55;
const double pi = 3.1415926535897932384626433;
const long double eps = 1e-12;
long long fast_pow(int a, int b) {
  long long res = a, ret = 1;
  while (b > 0) {
    if (b % 2) ret = (ret * res) % mod;
    res = (res * res) % mod;
    b /= 2;
  }
  return ret;
}
unsigned long long fact(unsigned long long n) {
  if (n == 1 || n == 0) return 1;
  return ((n % mod) * (fact(n - 1) % mod) % mod);
}
int k;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> k;
  if (k == 1) {
    cout << "YES\n2 1\n1 2";
    return 0;
  }
  if (k % 2 == 0) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n" << 4 * k - 2 << ' ' << 2 * k * k - k << endl;
  int a[4 * k - 1];
  int l = 1;
  for (long long i = (1); i <= (4 * k - 2); ++i) a[i] = i;
  while (l < 4 * k - 2) {
    for (long long i = (l + 1); i <= (l + k - 1); ++i) {
      cout << a[l] << ' ' << a[i] << endl;
    }
    cout << a[l + 1] << ' ' << a[l + 2 * k - 2] << endl;
    cout << a[l + k - 1] << ' ' << a[l + 2 * k - 2] << endl;
    for (long long i = (l + 1); i <= (l + k - 1); ++i) {
      for (long long j = (l + k); j <= (l + 2 * k - 3); ++j) {
        cout << a[i] << ' ' << a[j] << endl;
      }
    }
    for (long long i = (l + k); i <= (l + 2 * k - 3); ++i) {
      cout << a[i] << ' ' << a[l + 2 * k - 2] << endl;
    }
    for (long long i = (l + 2); i <= (l + k - 3); i += (2)) {
      cout << a[i] << ' ' << a[i + 1] << endl;
    }
    l += 2 * k - 1;
  }
  cout << a[1] << ' ' << a[2 * k];
  return (!false && !true) || ((long long)((long long)(1713 + 2377 + 1464) *
                                           (long long)(1713 + 2377 + 1464) *
                                           (long long)(1713 + 2377 + 1464)) !=
                               (long long)(171323771464));
}
