#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <cmath>
using namespace std;

int main() {
    int n;cin>>n;
    
    vector<vector<int>> dp(n,vector<int>(n,-1));
    vector<vector<bool>> tate(n,vector<bool>(4,false));
    vector<vector<bool>> yoko(n,vector<bool>(4,false));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<n;k++){
                if(!tate[j][k] && !yoko[i][k]){
                    dp[i][j] = k;
                    tate[j][k] = true;yoko[i][k]=true;
                    break;
                }
            }
        }
    }
    
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cout << dp[i][j]+1 << " ";
        }
        cout << endl;
    }
}