#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read(register T& t) {
  register T f = 1;
  register char ch = getchar();
  t = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -f;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') t = t * 10 + ch - '0', ch = getchar();
  t *= f;
  return t;
}
template <typename T, typename... Args>
inline void read(T& t, Args&... args) {
  read(t);
  read(args...);
}
const long long p = 998244353;
inline long long power(register long long x, register long long k = p - 2) {
  register long long re = 1;
  for (; k; k >>= 1, x = x * x % p)
    if (k & 1) re = re * x % p;
  return re;
}
int n;
void solve1(int a) {
  a--;
  printf("%d %d\n", a + 1, a + 2);
  printf("%d %d\n", a + 3, a + 4);
  printf("%d %d\n", a + 1, a + 4);
  printf("%d %d\n", a + 2, a + 3);
  printf("%d %d\n", a + 1, a + 3);
  printf("%d %d\n", a + 2, a + 4);
}
void solve2(int a) {
  a--;
  printf("%d %d\n", a + 1, a + 2);
  printf("%d %d\n", a + 1, a + 3);
  printf("%d %d\n", a + 1, a + 4);
  printf("%d %d\n", a + 2, a + 3);
  printf("%d %d\n", a + 2, n);
  printf("%d %d\n", a + 3, n);
  printf("%d %d\n", a + 1, n);
  printf("%d %d\n", a + 3, a + 4);
  printf("%d %d\n", a + 2, a + 4);
  printf("%d %d\n", a + 4, n);
}
void solve3(int a, int b) {
  a--;
  b--;
  printf("%d %d\n", a + 1, b + 1);
  printf("%d %d\n", a + 2, b + 2);
  printf("%d %d\n", a + 1, b + 2);
  printf("%d %d\n", a + 2, b + 1);
  printf("%d %d\n", a + 1, b + 3);
  printf("%d %d\n", a + 2, b + 4);
  printf("%d %d\n", a + 1, b + 4);
  printf("%d %d\n", a + 2, b + 3);
  printf("%d %d\n", a + 3, b + 1);
  printf("%d %d\n", a + 4, b + 2);
  printf("%d %d\n", a + 3, b + 2);
  printf("%d %d\n", a + 4, b + 1);
  printf("%d %d\n", a + 3, b + 3);
  printf("%d %d\n", a + 4, b + 4);
  printf("%d %d\n", a + 3, b + 4);
  printf("%d %d\n", a + 4, b + 3);
}
int main() {
  read(n);
  if (((n - 1) * n / 2) % 2) return printf("NO\n"), 0;
  printf("YES\n");
  if (n % 4 == 0)
    for (int i = 1; i < n; i += 4) solve1(i);
  else
    for (int i = 1; i < n; i += 4) solve2(i);
  for (int i = 1; i < n; i += 4)
    for (int j = i + 4; j < n; j += 4) solve3(i, j);
  return 0;
}
