#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define all(a) begin(a), end(a)
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define asort(a) stable_sort(all(a))
#define rsort(a) stable_sort(rbegin(a), rend(a))
#define sum(a) reduce(all(a))
#define min_(a) reduce(all(a), *begin(a), [](auto x, auto y) { return min(x, y); })
#define max_(a) reduce(all(a), *begin(a), [](auto x, auto y) { return max(x, y); })
constexpr double degrees(double a) { return (a * 180.0) / M_PI; }
constexpr double radians(double a) { return (a * M_PI) / 180.0; }

int main(int, [[maybe_unused]] char *argv[]) {
#ifdef DEBUG
  freopen(argv[1], "r", stdin);
#endif

  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);

  int N;
  cin >> N;

  if (N == 2) {
    cout << "No" << endl;
    return 0;
  }

  vector<int> ans, even;
  rep(i, 1, N + 1) {
    if (i % 2)
      ans.push_back(i);
  }
  rep(i, 1, N + 1) {
    if (!(i % 2))
      even.push_back(i);
  }
  reverse(all(even));
  ans.insert(ans.end(), even.begin(), even.end());

  cout << "Yes" << endl;
  rep(i, 0, N) {
    i ? cout << ' ' << ans[i] : cout << ans[i];
  }
  cout << endl;
  return 0;
}