#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

bool check(vector<int> a, vector<int> b) {
    if (accumulate(all(a), 0) != accumulate(all(b), 0)) return false;
    int n = sz(a);
    rep(i, n - 1) {
        if (a[i] >= a[i + 1] || b[i] >= b[i + 1]) return false;
    }
    if (a[0] < 0 || b[0] < 0 || a[n - 1] > 10000 || b[n - 1] > 10000) return false;
    rep(i, n) rep(j, n) rep(k, n) rep(l, n) {
        if (a[i] + a[j] == b[k] + b[l]) return false;
    }
    return true;
}

int main() {
    int N;
    cin >> N;

    int M = N / 3;
    vector<int> a(N), b(N);

    if (N % 3 == 0) {
        rep(i, N) {
            a[i] = 3 * i + 1;
            b[i] = 3 * i;
        }
        rep2(i, M, N - 1) a[i] += 3;
        b[0] = 3 * N;
    } else if (N % 3 == 1) {
        rep(i, N) {
            a[i] = 3 * i + 1;
            b[i] = 3 * i;
        }
        rep2(i, M, N - 1) a[i] += 3;
        a[0] = 0;
        b[0] = 3 * N;
    } else {
        rep(i, N) {
            a[i] = 3 * i + 7;
            b[i] = 3 * i + 6;
        }
        int K = 2 * N + 14;
        while (K > 0) {
            rep3(i, N - 1, 2) {
                a[i] += 3;
                K -= 3;
                if (K <= 0) break;
            }
        }
        a[0] = 0, a[1] = 3;
        b[0] = 3 * N + 6;
    }

    sort(all(a)), sort(all(b));
    print(a), print(b);

    // cout << check(a, b) << '\n';
}