#include #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr int MOD = 1000000007; constexpr double PI = 3.14159265358979323846; vector dx = {0,1,0,-1}; vector dy = {1,0,-1,0}; int main(){ int n; cin >> n; vector> maze(n,vector(n,-1)); int i = 0,j = 0,d = 0; for(int k=1;k<=n*n;k++){ //cout << i << " " << j << endl; maze[i][j] = k; int new_i = i + dx[d]; int new_j = j + dy[d]; if(new_i < 0 || new_j < 0 || n <= new_i || n <= new_j){ i += dx[(d+1)%4]; j += dy[(d+1)%4]; d = (d+1)%4; }else if(maze[new_i][new_j]>0){ i += dx[(d+1)%4]; j += dy[(d+1)%4]; d = (d+1)%4; }else{ i = new_i; j = new_j; } } rep(i,n){ rep(j,n) printf("%03d ",maze[i][j]); cout << endl; } return 0; }