#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 1000000007;
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
  for (auto& v : t) {
    i >> v;
  }
  return i;
}
template <typename T>
std::ostream& operator<<(std::ostream& o, const vector<T>& t) {
  for (size_t i = 0; i < t.size(); ++i) {
    o << t[i] << " \n"[i == t.size() - 1];
  }
  return o;
}
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
  i >> p.first >> p.second;
  return i;
}
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T, vector<T>, less<T>>;
auto fraclt = [](const std::pair<int, int>& a, const std::pair<int, int>& b) {
  return (long long)a.first * b.second < (long long)b.first * a.second;
};
struct cmpfrac {
  bool operator()(const std::pair<int, int>& a,
                  const std::pair<int, int>& b) const {
    return (long long)a.first * b.second < (long long)b.first * a.second;
  }
};
struct input {
  std::istream& cin;
  explicit input(std::istream& cin) : cin(cin) {}
  template <typename T>
  operator T() {
    T t;
    cin >> t;
    return t;
  }
};
int logceil(long long first) {
  int b = 0;
  while (first) {
    first >>= 1;
    ++b;
  }
  return b;
}
namespace std {
template <typename T, typename U>
struct hash<pair<T, U>> {
  hash<T> t;
  hash<U> u;
  size_t operator()(const pair<T, U>& p) const {
    return t(p.first) ^ (u(p.second) << 7);
  }
};
}  // namespace std
template <typename T, typename F>
T bsh(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      l = m + 1;
      r = m;
    } else {
      h = m - 1;
    }
  }
  return r;
}
template <typename T, typename F>
T bsl(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      h = m - 1;
      r = m;
    } else {
      l = m + 1;
    }
  }
  return r;
}
template <typename T>
T gcd(T a, T b) {
  if (a < b) swap(a, b);
  return b ? gcd(b, a % b) : a;
}
template <typename T>
class vector2 : public vector<vector<T>> {
 public:
  vector2() {}
  vector2(size_t a, size_t b, T t = T())
      : vector<vector<T>>(a, vector<T>(b, t)) {}
};
template <typename T>
class vector3 : public vector<vector<vector<T>>> {
 public:
  vector3() {}
  vector3(size_t a, size_t b, size_t c, T t = T())
      : vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, t))) {}
};
class TaskE {
 public:
  vector<std::pair<int, int>> R;
  int N;
  void swap4(int a, int b, int c, int d) {
    R.push_back({a, c});
    R.push_back({b, d});
    R.push_back({a, d});
    R.push_back({b, c});
  }
  void solve(istream& cin, ostream& cout) {
    cin >> N;
    if (N == 1) {
      cout << "YES\n";
      return;
    }
    if (N % 4 == 2 || N % 4 == 3) {
      cout << "NO\n";
      return;
    }
    for (int i = 0; i < N / 2; ++i) {
      for (int j = i + 1; j < N / 2; ++j) {
        swap4(2 * i + 1, 2 * i + 2, 2 * j + 1, 2 * j + 2);
      }
    }
    for (int i = 0; i < N / 2; ++i) {
      if (N % 4 == 1) R.push_back({2 * i + 1, N});
      R.push_back({2 * i + 1, 2 * i + 2});
      if (N % 4 == 1) R.push_back({2 * i + 2, N});
    }
    cout << "YES\n";
    for (std::pair<int, int> r : R) {
      cout << r.first << ' ' << r.second << '\n';
    }
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  TaskE solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
