#include <bits/stdc++.h>   using namespace std;   int a[55][55];   int main() {     int n;     scanf( %d , &n);     memset(a, 0, sizeof(a));     int p = 1, q = 2, nn = n / 2 + 1;     for (int i = 1; i <= n; ++i) {       a[nn][i] = p;       p += 2;     }     for (int i = 1; i <= n; ++i) {       if (i != nn) {         a[i][nn] = p;         p += 2;       }     }     int maxn = n * n;     for (int i = 1; i < nn; ++i) {       for (int j = 1; j < nn; ++j) {         if (p <= maxn) {           a[i][j] = p;           a[n + 1 - i][j] = p + 2;           a[n + 1 - i][n + 1 - j] = p + 4;           a[i][n + 1 - j] = p + 6;           p += 8;         } else {           a[i][j] = q;           a[n + 1 - i][j] = q + 2;           a[n + 1 - i][n + 1 - j] = q + 4;           a[i][n + 1 - j] = q + 6;           q += 8;         }       }     }     for (int i = 1; i <= n; ++i) {       for (int j = 1; j <= n; ++j) printf( %d  , a[i][j]);       printf(  n );     }     return 0;   }   