#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 511;
int a[N][N];

int main() {
	ios :: sync_with_stdio(false);
	int n; cin >> n;
	
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= n; j ++) {
			int p = i + j - 1;
			if(p > n) p -= n;
			
			int x = i - j + 1;
			if(x < 1) x += n;
			
			a[i][p] = x;
		}
	}
	
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= n; j ++)
			cout << a[i][j] << ' ';
		cout << '\n';
	}
}