#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,-1,0,1,1,1,-1,-1,0};
const ll dx[9]={1,0,-1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


int main(){
    ll n;cin >> n;
    vl a(n),b(n);
    rep(i,n){
        a[i]=(i+1)*3;
        b[i]=a[i]+1;
    }
    a[0]=0;a[1]=3;a[2]=6;
    ll p=accumulate(all(b),0LL)-accumulate(all(a),0LL);
    //cout << p << endl;
    if(n%3==0){
        ll now=n-1;
        while(p){
            a[now]+=3;
            p-=3;
            now--;
            if(now<0)now+=n;
        }
    }
    else if(n%3==1){
        ll now=n-1;
        a[n-1]++;p--;
        while(p){
            a[now]+=3;
            p-=3;
            now--;
            if(now<0)now+=n;
        }
    }
    else {
        a[n-2]+=4;
        a[n-1]+=4;
        p-=8;
        ll now=n-1;
        while(p){
            a[now]+=3;
            p-=3;
            now--;
            if(now<0)now+=n;
        }
    }
    rep(i,n)cout << a[i] <<" ";cout << endl;
    rep(i,n)cout << b[i] <<" ";cout << endl;
    //cout << a.back() << endl;
}