#include <iostream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int main()
{
const int N = 6;
int m[N][N] = { 0 };
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int x = min(min(i, j), min(N - 1 - i, N - 1 - j));
m[i][j] = N * N + 1 - (i > j
? (N - 2 * x - 2) * (N - 2 * x - 2) + (i - x) + (j - x)
: (N - 2 * x) * (N - 2 * x) - (i - x) - (j - x)
);
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cout << setw(5) << m[i][j];
}
cout << endl;
}
return 0;
}type tabelo = array[byte,byte] of integer;
procedure filling_spiral(var Q:tabelo; a,b:integer);
var c,d,e,f,g,h:integer;
begin
c:=a-1;
d:=b-1;
e:=1;
if a>=b then f:=b else f:=a;
for g:=0 to (f div 2) do
begin
for h:=b-d+g to d-g do
begin
if Q[a-c+g,h]=0 then Q[a-c+g,h]:=e else break;
inc(e)
end;
for h:=a-c+g to c-g do
begin
if Q[h,b-g]=0 then Q[h,b-g]:=e else break;
inc(e)
end;
for h:=b-g downto b-d+g+1 do
begin
if Q[a-g,h]=0 then Q[a-g,h]:=e else break;
inc(e)
end;
for h:=a-g downto a-c+g do
begin
if Q[h,b-d+g]=0 then Q[h,b-d+g]:=e else break;
inc(e)
end
end
end;
