#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n;
while (cin >> n, n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int up = i, down = n - i + 1, left = j, right = n - j + 1;
cout << min(min(up, down), min(left, right)) << ' ';
}
cout << endl;
}
cout << endl;
}
return 0;
}
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
// 第一种解法:
int a[110][110];
int n;
while (cin >> n, n) {
for (int i = 1; i <= n; i++) {
for (int j = i, k = 1; j <= n; j++, k++) {
a[i][j] = k;
a[j][i] = k;
}