#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define rep(i,n) for(ll i=0;i<(n);i++) #define pll pair<ll,ll> #define pq priority_queue #define pb push_back #define eb emplace_back #define fi first #define se second #define endl '\n' #define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0); #define lb(c,x) distance(c.begin(),lower_bound(all(c),x)) #define ub(c,x) distance(c.begin(),upper_bound(all(c),x)) using namespace std; 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=1e9+7; const ll mod=1e9+7; int main() { ll n; cin >> n; vector<vector<ll>> a(n,vector<ll>(n)); rep(i,n){ for(ll j=i;j<i+n;j++){ if(i==j) a[i][j%n]=i; else a[i][j%n]=(a[i][(j-1+n)%n]-1+n)%n; } } rep(i,n){ rep(j,n){ if(j) cout << " "; cout << a[i][j]+1; } cout << endl; } return 0; }