#include<bits/stdc++.h>
using ll=long long;
using namespace std;
ll n1[40][40],i1=0,j1=0;
int main(){
	ll n;
	cin>>n;
	n1[1][n/2+1]=1;
	j1=n/2+1;
	for(ll i=2;i<=n*n;i++){
		if(i1==1 && j1!=n){
			i1=n;
			j1++;
			n1[i1][j1]==i;
		}else if(i1!=1 && j1==n){
			i1--;
			j1=1;
			n1[i1][j1]==i;
		}else if(i1==1 && j1==n){
			i1++;
			n1[i1][j1]==i;
		}else if(i1!=1 && j1!=n-1){
			if(n1[i1-1][j1+1]==0){
				i1--;
				j1++;
				n1[i1][j1]=i;
			}else{
				i1++;
				n1[i1][j1]=i;
			}
		}
	}for(ll i=1;i<=n;i++){
		for(ll j=1;j<=n;j++){
			cout<<n1[i][j]<<' ';
		}cout<<endl;
	}return 0;
}