#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N;
	cin >> N;
	vi v, w;

	lint a=0, b=0, c=0, x, y, z;
	if (N%3 != 2) {
		rep(i, N) v.pb(3*(i+1));
		rep(i, N-1) w.pb(3*(i+1)-2);
		rep(i, N) a += v[i];
		rep(i, N-1) b += w[i];
		w.pb(a-b);
		c = N-2;
		while (w[N-1] > 10000) {
			w[c] += 3;
			w[N-1] -= 3;
			c--;
		}
	} else {
		rep(i, N) v.pb(3*(i+1));
		rep(i, N) w.pb(3*(i+1)-2);
		rep(i, N) a += v[i];
		rep(i, N) b += w[i];
		w[N-2] += (a-b)/2;
		w[N-1] += (a-b)/2;
		c = N-3;
		while (w[N-1] > 10000) {
			w[c] += 3;
			w[N-1] -= 3;
			c--;
		}
		while (w[N-2] > 10000-3) {
			w[c] += 3;
			w[N-2] -= 3;
			c--;
		}
	}
	if (N == 5) {
		a = 0, b = 0;
		rep(i, N) v[i] = 1000+i;
		rep(i, N-1) w[i] = i;
		rep(i, N) a += v[i];
		rep(i, N-1) b += w[i];
		w[N-1] = a-b;
	}
	vout(v);
	vout(w);
}