Problem: Seyyed and MoJaK are friends of Sajjad. Sajjad likes a permutation. Seyyed wants to change the permutation in a way that Sajjad won't like it. Seyyed thinks more swaps yield more probability to do that, so he makes MoJaK to perform a swap between every pair of positions (i, j), where i < j, exactly once. MoJaK doesn't like to upset Sajjad.

Given the permutation, determine whether it is possible to swap all pairs of positions so that the permutation stays the same. If it is possible find how to do that. 

Input

The first line contains single integer n (1 ≤ n ≤ 1000) — the size of the permutation.

As the permutation is not important, you can consider ai = i, where the permutation is a1, a2, ..., an.

Output

If it is not possible to swap all pairs of positions so that the permutation stays the same, print "NO",

Otherwise print "YES", then print <image> lines: the i-th of these lines should contain two integers a and b (a < b) — the positions where the i-th swap is performed.

Examples

Input

3


Output

NO


Input

1


Output

YES

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long n;
inline void f(long long x, long long y) { cout << x << ' ' << y << '\n'; }
int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  cin >> n;
  if ((n & 3) > 1) cout << "NO\n", exit(0);
  cout << "YES\n";
  for (long long i = 1; i <= n - 1; i++) {
    for (long long j = i + 2; j <= n - 1; j++)
      f(i, j), f(i + 1, j + 1), f(i, j + 1), f(i + 1, j), ++j;
    if (n % 4)
      f(i, n), f(i, i + 1), f(i + 1, n);
    else
      f(i, i + 1);
    ++i;
  }
  return 0;
}