#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { std::cin >> t; } templatevoid Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); } #define OUT(d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i=ll(a);--i) #define REPLL(i, n) for(ll i=0;i=0;--i) #define PAIR std::pair #define IN(a, x, b) (a<=x && x(end-start).count();std::cerr<<"[Time:"< tmp(a);std::cout << #a << "\t:";for(int i=0; i(a.size()); ++i){std::cout << tmp.front() << "\n";tmp.pop();}std::cout << "\n";} #define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a)) #define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a)) //#define int ll using ll = long long; using ull = unsigned long long; constexpr int INFINT = 1 << 30; constexpr ll INFLL = 1LL << 60; constexpr double EPS = 0.0000000001; constexpr int MOD = 1000000007; signed main() { INIT; VAR(int, n); std::vector> m(n, std::vector(n, 0)); if (n & 1) { int num = 1; int i = 0, j = n / 2; while (num <= n*n) { m[i][j] = num++; i = (i - 1 + n) % n; j = (j + 1) % n; if (m[i][j] != 0) { i = (i + 2) % n; j = (j - 1 + n) % n; } } } else if (n % 4 == 0) { std::vector> bit(n, std::vector(n, false)); REP(i, n) REP(j, n) { bool t = true; if (i % 4 == 0 || i % 4 == 3) t = false; if (j % 4 == 0 || j % 4 == 3) t ^= true; bit[i][j] = t; } int up = 1, down = n*n; REP(i, n) REP(j, n) { if (bit[i][j]) m[i][j] = up; else m[i][j] = down; ++up; --down; } } else { int tn = n / 2; std::vector> base(tn, std::vector(tn, 0)); int num = 1; int i = 0, j = tn / 2; while (num <= tn*tn) { base[i][j] = num++; i = (i - 1 + tn) % tn; j = (j + 1) % tn; if (base[i][j] != 0) { i = (i + 2) % tn; j = (j - 1 + tn) % tn; } } REP(i, tn) REP(j, tn) { m[i * 2][j * 2] = (base[i][j] - 1) * 4; m[i * 2 + 1][j * 2] = (base[i][j] - 1) * 4; m[i * 2][j * 2 + 1] = (base[i][j] - 1) * 4; m[i * 2 + 1][j * 2 + 1] = (base[i][j] - 1) * 4; } REP(i, n) REP(j, n) { if (i < n / 2) { if (i % 2 == 0 && j % 2 == 0) m[i][j] += 4; if (i % 2 == 1 && j % 2 == 0) m[i][j] += 2; if (i % 2 == 0 && j % 2 == 1) m[i][j] += 1; if (i % 2 == 1 && j % 2 == 1) m[i][j] += 3; } else if (i == n / 2) { if (i % 2 == 0 && j % 2 == 0) m[i][j] += 1; if (i % 2 == 1 && j % 2 == 0) m[i][j] += 2; if (i % 2 == 0 && j % 2 == 1) m[i][j] += 4; if (i % 2 == 1 && j % 2 == 1) m[i][j] += 3; } else { if (i % 2 == 0 && j % 2 == 0) m[i][j] += 1; if (i % 2 == 1 && j % 2 == 0) m[i][j] += 3; if (i % 2 == 0 && j % 2 == 1) m[i][j] += 4; if (i % 2 == 1 && j % 2 == 1) m[i][j] += 2; } } m[tn + 0 + 0][tn + 0] += -3; m[tn + 0 + 0][tn + 1] += 3; m[tn + 2 + 0][tn + 0] += 3; m[tn + 2 + 0][tn + 1] += -3; } REP(i, n) { REP(j, n) { OUT(m[i][j])SP; }BR; } return 0; }