#include <bits/stdc++.h>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
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;
}
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;

void solve()
{
  int n;
  cin >> n;
  int sum = 0;
  for (int i = 0; i < n; ++i)
  {
    cout << 3 * i + 1 << " \n"[i + 1 == n];
    sum += 3 * i + 1;
  }

  auto calc = [](const int r, const int len) -> int
  {
    const int l = r - 3 * (len - 1);
    return (l + r) * len / 2;
  };
  std::vector<int> res;
  if (n % 3 == 0)
  {
    for (int i = 0; i < n; ++i)
    {
      int val = 3 * i;
      if (val + calc(9999, n - 1 - i) <= sum)
      {
        val = sum - calc(9999, n - 1 - i);
      }
      if (i + 1 == n)
        val = sum;
      if (i + 1 < n)
        sum -= val;
      res.emplace_back(val);
    }
  }
  else if (n % 3 == 1)
  {
    res.emplace_back(9998);
    sum -= 9998;
    for (int i = 1; i < n; ++i)
    {
      int val = 3 * i;
      if (val + calc(9999, n - 1 - i) <= sum)
      {
        val = sum - calc(9999, n - 1 - i);
      }
      if (i + 1 == n)
        val = sum;
      if (i + 1 < n)
        sum -= val;
      res.emplace_back(val);
    }
  }
  else
    assert(false);
  std::sort(res.begin(), res.end());
  for (int i = 0; i < (int)res.size(); ++i)
  {
    cout << res[i] << " \n"[i + 1 == n];
  }
}

int main()
{
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  int I_love_KKT89 = 1;
  // cin >> I_love_KKT89;
  while (I_love_KKT89--)
    solve();
  return 0;
}