#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { int n; cin >> n; int a[n][n]; a[n-1][0] = 1; srep(j,1,n) a[n-1][j] = (a[n-1][j-1]+2) % n; rep(j,n){ drep(i,n-1){ a[i][j] = (a[i+1][j]+1) % n; } } rep(i,n){ rep(j,n){ if(j == n-1)cout << a[i][j] + 1 << endl; else cout << a[i][j] + 1 << ' '; } } return 0; }