#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
using namespace std;
ll INF = 1LL<<60;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define nfor(i,s,n) for(int i=s;i<n;++i)
#define dfor(i,s,n) for(ll i=(s)-1;i>=n;--i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
#define pop_cnt(s) ll(popcount(uint64_t(s)))
#define next_p(v) next_permutation(all(v))
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define yn(ans) cout << (ans ? "Yes" : "No") << "\n"
#define YN(ans) cout << (ans ? "YES" : "NO") << "\n"
#define fix(n) fixed<<setprecision((int)(n))
using P = pair<ll,ll>;
template<class T> using pq = priority_queue<T,vector<T>>;
template<class T> using pq_g = priority_queue<T,vector<T>,greater<T>>;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using vvv = vv<vc<T>>;
template<class T>istream& operator>>(istream& i,vc<T>& v){ rep(j, size(v))i>>v[j]; return i; }


int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n;cin>>n;
  ll tekazu=n/3;
  ll a[3][3];
  rep(i,3){
    rep(j,3){
      a[i][j]=tekazu;
    }
  }
  ll amari=n%3;
  if(amari!=0&&(tekazu+1)%2==0){
    rep(i,amari){
      a[i][0]++;
      a[i][1]++;
      a[i][2]++;
    }
  }else if(amari!=0&&(tekazu+1)%2!=0){
    rep(i,amari){
      a[0][i]++;
      a[1][i]++;
      a[2][i]++;
    }
  }
  rep(i,3){
    rep(j,3){
      cout<<a[i][j]<<" \n"[j==2];
    }
  }
}