#include <bits/stdc++.h>
using namespace std;

int n,a[20][20],k=0;
void dfs(int x,int y){
	k++;
	a[x][y]=k;
	if(a[x][y+1]==0&&y+1<=n)dfs(x,y+1);
	if(a[x+1][y]==0&&x+1<=n)dfs(x+1,y);
	if(a[x][y-1]==0&&y-1>=1)dfs(x,y-1);
	if(a[x-1][y]==0&&x-1>=1)dfs(x-1,y);
}
int main(){
	cin>>n;
	int i,j;
	dfs(1,1);
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++)cout<<setw(3)<<a[i][j];
		cout<<endl;
	} 
	return 0;
}
请大佬们帮帮蒟蒻吧！！！