#include #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--) #define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++) #define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--) #define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++) #define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++) #define ALL(x) x.begin(), x.end() using ll = long long; using namespace std; int main(){ int n; cin >> n; vector> ans(n, vector(n)); int d = n, st = 0; rep(i, n){ rep(j, n){ ans.at((d+j+n)%n).at(j) = (st+j)%n; } st++; d--; } rep(i, n){ rep(j, n){ if(j != 0) cout << " "; cout << ans.at(i).at(j)+1; } cout << endl; } return 0; }