#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int M = 10000;
  int n; cin >> n;
  vector<int> a, b;
  if (n <= 11 && n % 3 == 2) {
    a.resize(n);
    iota(ALL(a), 100);
    b.resize(n - 1);
    iota(ALL(b), 0);
    const ll d = accumulate(ALL(a), 0) - accumulate(ALL(b), 0);
    b.emplace_back(d);
  } else {
    REP(i, M + 1) {
      if (a.size() < n && i % 3 == 0) a.emplace_back(i);
      if (b.size() < n && i % 3 == 1) b.emplace_back(i);
    }
    ll d = accumulate(ALL(b), 0LL) - accumulate(ALL(a), 0LL);
    if (n % 3 == 1) {
      --d;
      ++a.back();
    } else if (n % 3 == 2) {
      d -= 2;
      ++a.end()[-1];
      ++a.end()[-2];
      while (d >= 6 && a.back() + 3 <= M) {
        d -= 6;
        a.end()[-1] += 3;
        a.end()[-2] += 3;
      }
    }
    while (d >= 3 && a.back() + 3 <= M) {
      d -= 3;
      a.back() += 3;
    }
    for (int i = n - 2; i >= 0; --i) {
      while (d > 0 && a[i] + 3 < a[i + 1]) {
        d -= 3;
        a[i] += 3;
      }
    }
  }
  assert(accumulate(ALL(a), 0LL) == accumulate(ALL(b), 0LL));
  REP(i, n) cout << a[i] << " \n"[i + 1 == n];
  REP(i, n) cout << b[i] << " \n"[i + 1 == n];
  return 0;
}