Contest1401/J.java

import java.util.Scanner;

public class J {
    public static void main(String[] args) {
        while (cin.hasNext()) {
            int n = cin.nextInt();
            if (n == 0) break;
            int[][] a = new int[n][n];
            int x = n - 1, y = n / 2;
            a[x][y] = 1;
            for (int i = 2; i <= n * n; i++) {
                int nx = (x + 1) % n;
                int ny = (y + 1) % n;
                if (a[nx][ny] > 0) {
                    nx = (n + x - 1) % n;
                    ny = y;
                }
                a[x = nx][y = ny] = i;
            }
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.print(a[i][j] + " ");
                }
                System.out.println();
            }
            System.out.println();
        }

        cin.close();
    }

    static Scanner cin = new Scanner(System.in);
}