#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N;
ll A[3030],B[3030];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	int add=0;
	FOR(i,N) {
		A[i]=3*i;
		if(i>=2) A[i]+=6;
		B[i]=3*i+7;
		add+=B[i]-A[i];
	}
	if(N%3) A[0]++;
	if(N%3==2) A[1]++;
	
	A[N]=10002;
	add/=3;
	for(i=N-1;i>=2;i--) {
		x=min(A[i+1]-3,A[i]+add*3);
		add-=(x-A[i])/3;
		A[i]=x;
	}
	
	FOR(i,N) cout<<A[i]<<" ";
	cout<<endl;
	FOR(i,N) cout<<B[i]<<" ";
	cout<<endl;

}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}