#include <bits/stdc++.h>
using namespace std;

std::vector<int> Divide(int m){
  if (!m) return {1};
  auto a=Divide(m-1);
  auto b=a;
  std::reverse(a.begin(),a.end());
  for (int x:a)
    b.push_back(x|1<<m);
  b.push_back(1<<m);
  return b;
}

void solve(){
  int n;
  std::cin>>n;
  int m=0;
  for (int t=n;t;t>>=1) ++m;
  std::vector<int> ans;
  if (m<=3){
    if (n!=(1<<m)-1){
      std::cout<<"NO\n";
      return;
    }
    ans=Divide(m-1);
  }else{
    if (n<=(1<<(m-1)|1<<(m-2))){
      std::cout<<"NO\n";
      return;
    }
    // std::cerr<<" m : "<<m<<'\n';
    ans=Divide(m-2);
    ans.pop_back();
    // std::cerr<<" size : "<<ans.size()<<'\n';
    auto t=Divide(m-3);
    for (int x:t){
      x|=1<<(m-1);
      if ((x|1<<(m-2))<=n)
        ans.push_back(x|1<<(m-2));
      ans.push_back(x);
    }
    ans.push_back(1<<(m-1));
    ans.push_back(1<<(m-1)|1<<(m-2));
    ans.push_back(1<<(m-2));
  }
  std::cout<<"YES\n";
  for (int x:ans)
    std::cout<<x<<' ';
  std::cout<<'\n';
}

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int T=1;
  while(T--) solve();
}