#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;

#define rep(i, init, end) for(ll i = init; i < end; i++)
#define REP(i, init, end) for(ll i = init; i < end + 1; i++)
#define rev(i, end, init) for(ll i = init - 1; i >= end; i--)
#define REV(i, end, init) for(ll i = init; i >= end; i--)
#define PI 3.14159265359
#define EPS 0.0000000001
// #define MOD 1000000007
//cout << std::fixed << std::setprecision(15) << y << endl;


int main(){
    ll N;
    cin >> N;

    ll base = N / 3;
    ll direction = (N / 3) % 2;

    ll ans[3][3];
    rep(i, 0, 3){
        rep(j, 0, 3){
            ans[i][j] = base;
        }
    }
    if(direction == 0){
        rep(i, 0, 3){
            rep(j, 0, N % 3){
                ans[i][j]++;
            }
        }
    }else{
        rep(i, 0, N % 3){
            rep(j, 0, 3){
                ans[i][j]++;
            }
        }
    }

    rep(i, 0, 3){
        rep(j, 0, 3){
            cout << ans[i][j];
            if(j < 2){
                cout << " ";
            }
        }
        cout << endl;
    }

    return 0;
}