#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long

int d[35][35];

signed main(void) {
  int n;
  cin>>n;
  int i=1;
  int j=1;
  int flag=0;
  //はじを埋めておく！
  for(int l=0;l<=n+1;l++){
    d[l][0]=1;
    d[0][l]=1;
    d[n+1][l]=1;
    d[l][n+1]=1;
  } 
  int k=1;
  while(k<=n*n){
     if(d[i][j]==0){
      d[i][j]=k;
      k++;
      continue;
    }
    if(flag==0){
      if(d[i][j+1]==0) j++;
      else flag++;
      continue;
    }
    if(flag==1){
      if(d[i+1][j]==0) i++;
      else flag++;
      continue;
    }
    if(flag==2){
      if(d[i][j-1]==0) j--;
      else flag++;
      continue;
    }
    if(flag==3){
      if(d[i-1][j]==0) i--;
      else flag=0;
      continue;
    }
  }
  for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
      if(j !=1) cout<<" ";
      cout<<setfill('0')<<right<<setw(3)<<d[i][j];
    }
    cout<<endl;
  }
 
  return 0;
}