#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


constexpr int E = 22;

int N;
vector<int> us;

bool check() {
  uf.assign(N * E, -1);
  for (int x = 0; x < N; ++x) for (int y = 0; y < E; ++y) if (us[x] >> (y) & 1) {
    if (x + 1 < N && (us[x + 1] >> (y) & 1)) connect(x * E + y, (x + 1) * E + y);
    if (y + 1 < N && (us[x] >> (y + 1) & 1)) connect(x * E + y, x * E + (y + 1));
  }
  int numComps = 0;
  for (int x = 0; x < N; ++x) for (int y = 0; y < E; ++y) if (us[x] >> (y) & 1) {
    if (uf[x * E + y] < 0) ++numComps;
  }
  return (numComps == 1);
}

bool dfs(int i, Int used) {
  if (i == N) {
    if (check()) {
      return true;
    }
  } else {
    for (int &u = us[i] = 1; u <= N; ++u) if (!(used >> u & 1)) {
      if (i == 0 || (us[i - 1] & u)) {
        if (dfs(i + 1, used | 1LL << u)) {
          return true;
        }
      }
    }
  }
  return false;
}

void exper() {
  for (N = 1; ; ++N) {
    us.resize(N);
    const bool res = dfs(0, 0);
    if (res) {
      cerr << N << ": " << us << endl;
      for (int i = 0; i < N; ++i) {
        for (int e = E; --e >= 0; ) {
          cerr << (us[i] >> e & 1);
        }
        cerr << endl;
      }
    } else {
      cerr << N << ": NO" << endl;
    }
  }
}


#define N do_not_use_N
vector<int> solve(int n) {
  if (n == 1) return {1};
  if (n == 3) return {1, 3, 2};
  if (n == 7) return {1, 3, 2, 6, 4, 5, 7};
  if (n <= 7) return {};
  const int t = 31 - __builtin_clz(n);
  const int n0 = (1<<t) + (1<<(t-1)) + 1;
  const int last = (1<<(t+1)) - 1;
  if (n < n0) return {};
  const auto as = solve((1<<t) - 1);
  const auto as1 = solve((1<<(t-1)) - 1);
  auto ret = as;
  ret.push_back(n0);
  for (const int a : as1) {
    ret.push_back((1<<t) + a);
    const int b = (1<<t) + (1<<(t-1)) + a;
    if (n0 < b && b <= n && b < last) {
      ret.push_back(b);
    }
  }
  ret.push_back((1<<t));
  ret.push_back((1<<t) + (1<<(t-1)));
  if (last <= n) {
    ret.push_back(last);
  }
  return ret;
}
#undef N

void stress() {
  // for (N = 1; N <= 100; ++N) {
  for (N = 200'000; N <= 200'000; ++N) {
    us = solve(N);
    cerr << N << ": " << us << endl;
    if (us.size()) {
      for (int i = 0; i < N; ++i) {
        assert(1 <= us[i]); assert(us[i] <= N);
      }
      assert((int)set<int>(us.begin(), us.end()).size() == N);
      assert(check());
    }
  }
}

int main() {
  // exper();
#ifdef LOCAL
  stress();
#endif
  
  for (; ~scanf("%d", &N); ) {
    us = solve(N);
    if (us.size()) {
      puts("YES");
      for (int i = 0; i < N; ++i) {
        if (i) printf(" ");
        printf("%d", us[i]);
      }
      puts("");
    } else {
      puts("NO");
    }
  }
  return 0;
}