#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline int rd_int(void){
  int x;
  rd(x);
  return x;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int res[500][500];
int main(){
  int i;
  int N = rd_int();
  int ad = (N+1) / 2;
  for(i=(0);i<(N);i++){
    int j;
    for(j=(0);j<(N);j++){
      res[i][j] = 1 + (ad * (i+j)) % N;
    }
  }
  {
    int cTE1_r3A;
    int RZTsC2BF;
    for(cTE1_r3A=(0);cTE1_r3A<(N);cTE1_r3A++){
      if(N==0){
        wt_L('\n');
      }
      else{
        for(RZTsC2BF=(0);RZTsC2BF<(N-1);RZTsC2BF++){
          wt_L(res[cTE1_r3A][RZTsC2BF]);
          wt_L(' ');
        }
        wt_L(res[cTE1_r3A][RZTsC2BF]);
        wt_L('\n');
      }
    }
  }
  return 0;
}
// cLay varsion 20200813-1 [beta]

// --- original code ---
// int res[500][500];
// {
//   int N = rd_int();
//   int ad = (N+1) / 2;
//   rep(i,N) rep(j,N) res[i][j] = 1 + (ad * (i+j)) % N;
//   wt(res(N,N));
// }