#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
using Graph = vector<vector<ll> >;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;

//input
ll n;

int ans[510][510];
int solve[510][1010];

int main(){
    cin >> n;
    for(int i=1;i<=n;i++){
        solve[i][i]=i;
        solve[i][i+n]=i;
        for(int j=1;i-j>0;j++){
            solve[i][i+j]=i-j;
        }
        for(int j=1;i+j<=n;j++){
            solve[i][i+n-j]=i+j;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            ans[i][j]=max(solve[i][j],solve[i][j+n]);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<n;j++){
            cout << ans[i][j] << ' ';
        }
        cout << ans[i][n] << endl;
    }

    return 0;
}