#include using namespace std; #define ll long long #define rep(i,n) for(int i=0;i=0;i--) #define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--) #define vll(n,i) vector(n,i) #define v2ll(n,m,i) vector>(n,vll(m,i)) #define v3ll(n,m,k,i) vector>>(n,v2ll(m,k,i)) #define v4ll(n,m,k,l,i) vector>>>(n,v3ll(m,k,l,i)) #define all(v) v.begin(),v.end() #define chmin(k,m) k = min(k,m) #define chmax(k,m) k = max(k,m) #define Pr pair #define Tp tuple #define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr) //Graph struct graph { long long N; vector>> G; vector par_v; vector par_e; int edge_count = 0; graph(long long n) { N = n; G = vector>>(N); par_v = vector(N,-1); par_e = vector(N,-1); } void unite(long long a,long long b,long long cost = 1,bool directed = false){ G[a].emplace_back(b,cost,edge_count); if(!directed) G[b].emplace_back(a,cost,edge_count); edge_count++; } }; const ll mod = 998244353; template struct modint{ uint64_t val; constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){} constexpr modint operator-() const noexcept{ return modint(*this)=mod-val; } constexpr modint operator+(const modint rhs) const noexcept{ return modint(*this)+=rhs; } constexpr modint operator-(const modint rhs) const noexcept{ return modint(*this)-=rhs; } constexpr modint operator*(const modint rhs) const noexcept{ return modint(*this)*=rhs; } constexpr modint operator/(const modint rhs) const noexcept{ return modint(*this)/=rhs; } constexpr modint &operator+=(const modint rhs) noexcept{ val+=rhs.val; val-=((val>=mod)?mod:0); return (*this); } constexpr modint &operator-=(const modint rhs) noexcept{ val+=((val>=1; } return (*this)*=now; } modint & operator++(){ val++; if (val == mod) val = 0; return *this; } modint operator++(int){ modint res = *this; ++*this; return res; } constexpr bool operator==(const modint rhs) noexcept{ return val==rhs.val; } constexpr bool operator!=(const modint rhs) noexcept{ return val!=rhs.val; } friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{ return os<<(x.val); } friend constexpr istream &operator>>(istream& is,modint& x) noexcept{ uint64_t t; is>>t,x=t; return is; } }; typedef modint mint; mint pw(long long a,long long b,long long m = mod){ if(a%m==0) return mint(0); if(b==0) return mint(1); else if(b%2==0){ long long x = pw(a,b/2,m).val; return mint(x*x); } else{ long long x = pw(a,b-1,m).val; return mint(a*x); } } mint modinv(long long a, long long m = mod) { long long b = m, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; return mint(u); } #define vm(n,i) vector(n,i) #define v2m(n,m,i) vector>(n,vm(m,i)) #define v3m(n,m,k,i) vector>>(n,v2m(m,k,i)) #define v4m(n,m,k,l,i) vector>>>(n,v3m(m,k,l,i)) void out(vector &v){ for(ll x:v) cout << x << " "; cout << "\n"; return; } // 最大公約数を求める ll gcd(ll x,ll y){ ll r=1; if(x<0) x *= -1; if(y<0) y *= -1; if(x<=y) swap(x,y); if(y==0) r=0; while(r>0){ r=x%y; x=y; y=r; } return x; } int main(){ riano_; ll N,M,K,H,W; cin >> N; if(N==4){ cout << 10 << " " << 20 << " " << 30 << " " << 40 << endl; cout << 1 << " " << 2 << " " << 3 << " " << 94 << endl; return 0; } if(N==5){ cout << 10 << " " << 20 << " " << 30 << " " << 40 << " " << 50 << endl; cout << 1 << " " << 2 << " " << 3 << " " << 11 << " " << 133 << endl; return 0; } vector a,b; if(N%3==0){ rep(i,N+1){ if(3*i==N) continue; a.push_back(3*i); } rep(i,N){ b.push_back(3*i+2); } } else if(N%3==1){ rep(i,(N/3)*3+1){ if(3*i==(N/3)*3-3) continue; a.push_back(3*i); } rep(i,(N/3)*3){ b.push_back(3*i+2); } a.push_back(3*(N+1)); b.push_back(3*(N+2)); } else{ rep(i,(N/3)*3+1){ if(3*i==2*(N/3)*3-12) continue; a.push_back(3*i); } rep(i,(N/3)*3){ b.push_back(3*i+1); } a.push_back(3*(N+1)); a.push_back(3*(N+2)); b.push_back(3*(N+3)); b.push_back(3*(N+4)); } out(a); out(b); }