#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#endif
using namespace std;
#define done(...) return pp(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define maybe(p,c) (p?c:remove_cvref_t<decltype(c)>{})
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
template<class T>constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
template<class T>constexpr auto for_range(T s,T a,T b,T c=1){return array{a-s,b,(1-s*2)*c};}
const string space{char(32)};
void lin(auto&...a){(cin>>...>>a);}
auto Yes(bool p=1){return p?"Yes":"No";}
auto No(){return Yes(0);}
constexpr auto even(auto x){return~x&1;}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
}
namespace my{
template<class T>ostream&operator<<(ostream&o,const vector<T>&v){ll n=v.size();fo(i,n)o<<v[i]<<maybe(i<n-1,space);return o;}
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
  using vector<V>::vector;
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
}
namespace my{entry
void main(){
  LL(N);
  if(even(N))done(No());

  vec<ll>p(N);
  vec<ll>q(N);

  fo(i,N/2+1){
    p[i]=i*2+1;
    q[i]=N/2+1-i;
  }

  fo(i,N/2+1,N){
    p[i]=(i-N/2)*2;
    q[i]=N-(i-N/2-1);
  }

  pp(Yes());
  pp(p);
  pp(q);
}}