#include<bits/stdc++.h>
using namespace std;
int n;
void dfs(int n,int x,int y,vector<vector<int>> a,int i){
    a[x][y]=i;
    if(y+1<=n){
		if(a[x][y+1]==0) dfs(n,x,y+1,a,i+1);
	}
	if(x-1>=0){
		if(a[x-1][y]==0) dfs(n,x-1,y,a,i+1);
	}
	if(y-1>=0){
		if(a[x][y-1]==0) dfs(n,x,y-1,a,i+1);
	}
	if(x+1<=n){
		if(a[x+1][y]==0) dfs(n,x+1,y,a,i+1);
	}
}
int main(){
    cin>>n;
    vector<vector<int>> a(n,vector<int>(n,0));
    dfs(n,0,0,a,1);
    for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cout<<setw(3)<<a[i][j];
		}
		cout<<endl;
	}
	return 0;
}