#include<bits/stdc++.h>

using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC optimize("Ofast","inline","-ffast-math")

#define int long long 
#define F first 
#define S second 
#define pb push_back

int a[1005][1005];
void solve(){
    int n;
    cin>>n;
    int cnt=0, now=1;
    for(int i=1;i<=n;i+=7){
        for(int j=1;j<=n;j+=21){
            if(a[i][j]) continue;
            for(int x=i;x<=i+6;x++){
                if(x>n) break;
                for(int y=j;y<=j+20;y++){
                    if(y>n) break;
                    a[x][y]=now;
                }
            }
            now++;
        }
    }
    for(int i=1;i<=n;i++) {for(int j=1;j<=n;j++) cout<<a[i][j]<<" ";cout<<"\n";}
    
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    // int t;
    // cin>>t;
    // while(t--)
    solve();
    return 0;
}