#include 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 inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template 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 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) { for (int i = 0; i < n; ++i) { int val = 3 * i; if (i + 1 < n and val + calc(9999, n - 2 - i) + 10000 <= sum) { val = sum - calc(9999, n - 2 - i) - 10000; } if (i + 1 == n) val = sum; if (i + 1 < n) sum -= val; res.emplace_back(val); } } else { if (n == 5) { assert(false); res = {0, 3, 6, 7, 19}; } else { sum -= 3 * n + 1; res.emplace_back(3 * n + 1); sum -= 3 * (n - 1) + 1; res.emplace_back(3 * (n - 1) + 1); for (int i = 2; i < n; ++i) { int val = 3 * (i - 2); 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); } } } 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; }