#include // #include using namespace std; // using namespace atcoder; // using mint = modint998244353; //using mint = modint1000000007; using ll = long long; using P = pair; using T = tuple; templatebool chmax(T_& a, const T_& b) { if (a < b) { a = b;return true; } else { return false; } } templatebool chmin(T_& a, const T_& b) { if (a > b) { a = b;return true; } else { return false; } } #ifdef LOCAL template ostream& operator<<(ostream& o, const pair& p) { return o << "(" << p.first << ", " << p.second << ")"; } template ostream& operator<<(ostream& o, const tuple& t) { o << "("; apply([&o](auto&&... a) { int c = 0; (((o << (c++ ? ", " : "") << a)), ...); }, t); return o << ")"; } template auto operator<<(ostream& o, const V& v) -> std::enable_if_t && !std::is_same_v, decltype(v.begin(), o)> { o << "{"; int c = 0; for (auto& x : v) o << (c++ ? ", " : "") << x; return o << "}"; } #define dbg(...) cerr<<"["<<#__VA_ARGS__<<"]: ",([](auto&&... a){((cerr<> n; ll h = (n + 2) / 3; dbg(h); vector a(3, vector(3, n / 3)); if (h % 2 == 1) { if (n % 3 >= 1) { for (int i = 0; i < 3; i++) { a[i][0]++; } } if (n % 3 >= 2) { for (int i = 0; i < 3; i++) { a[i][1]++; } } } else { if (n % 3 >= 1) { for (int i = 0; i < 3; i++) { a[0][i]++; } } if (n % 3 >= 2) { for (int i = 0; i < 3; i++) { a[1][i]++; } } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cout << a[i][j] << ' '; }cout << "\n"; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; // cin >> t; while (t--) { solve(); } }