#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    int N;
    cin >> N;
    VI A(0), B(0);
    bool f = false;
    REP(i, N) {
        if (3 * i == 6996) {
            f = true;
        } else {
            A.push_back(3 * i);
        }
    }
    if (f) {
        A.push_back(9996);
    } else {
        A.back() += N / 3 * 3;
    }
    REP(i, N) B.push_back(3 * i + 1);
    if (N % 3 == 1) A.back()++;
    if (N % 3 == 2) {
        A.back() += 3;
        B.back()--;
    }
    REP(i, N) {
        cout << A[i];
        if (i < N - 1) cout << " ";
    }
    cout << endl;
    REP(i, N) {
        cout << B[i];
        if (i < N - 1) cout << " ";
    }
    cout << endl;
}