#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod =1000000007; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n, ll m = mod) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } ll gcd(ll a, ll b) { if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } vector> ad[3] = { {{4,1},{2,3}},{{1,4},{2,3}},{{1,4},{3,2}} }; vector> make_s(int n) { if (n % 2) { vector> res(n, vector(n)); vector> used(n, vector(n, false)); int x = 0, y = n / 2; rep1(i, n * n) { res[x][y] = i; used[x][y] = true; if (i < n * n) { int nx = x - 1, ny = y + 1; if (nx < 0)nx += n; if (ny == n)ny = 0; if (used[nx][ny]) { nx = x + 1, ny = y; if (nx == n)nx = 0; } x = nx, y = ny; } } return res; } if (n % 4 == 0) { vector> res(n, vector(n)); vector> col(n, vector(n)); int d = n / 2; rep(ax, 2)rep(ay, 2) { rep(i, d) { col[ax * d + i][ay * d + i] = 1; col[ax * d + i][ay * d + d - 1 - i] = 1; } } int cur = 1; rep(i, n)rep(j, n) { if (col[i][j]) { res[i][j] = cur; cur++; } } per(i, n)per(j, n) { if (!col[i][j]) { res[i][j] = cur; cur++; } } return res; } int d = n / 2; vector> res(n, vector(n)); vector> p = make_s(d); rep(i, d)rep(j, d) { p[i][j] = (p[i][j] - 1) * 4; } rep(i, d)rep(j, d) { int lx = 2 * i, ly = 2 * j; int col = 0; if (i > d / 2 + 1)col = 2; else if (i < d / 2 + 1) { col = 0; if (i == d / 2 && j == d / 2)col = 1; } else { col = 1; if (j == d / 2)col = 0; } rep(s, 2)rep(t, 2) { res[lx + s][ly + t] = ad[col][s][t]; } } return res; } void solve() { int n; cin >> n; vector> ans = make_s(n); rep(i, n) { rep(j, n) { if (j > 0)cout << " "; cout << ans[i][j]; } cout << "\n"; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); //init_f(); //init(); //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }