#include using namespace std; #define all(c) (c).begin(),(c).end() #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++) #define rep(i,n) REP(i,0,n) #define iter(c) __typeof((c).begin()) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) #define mem(a) memset(a,0,sizeof(a)) #define pb(a) push_back(a) #define in(a) insert(a) #define R cin>> #define F first #define S second #define Y typename #define ll long long #define GM(_1,_2,_3,N,...)N #define pr(...) GM(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__) templatevoid pr1(T a){cout<void pr2(T a,T2 b){cout<void pr3(T a,T2 b,T3 c){cout<void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { int n; cin >> n; int a[n][n]; mem(a); if(n%2 || n%4==2) { int m=n; if(n%4==2) n=n/2; int x=0,y=n/2; rep(i,n*n) { a[x][y]=i+1; x--;y++; if(x<0) x+=n; if(y>=n) y-=n; if(a[x][y]) { x+=2; y--; if(x>=n) x-=n; if(y<0) y+=n; } } if(m%4==2) { int b[n][n],c[n][n]; int d[3][4]={{4,1,2,3},{1,4,2,3},{1,4,3,2}}; rep(i,n)rep(j,n) { b[i][j]=(a[i][j]-1)*4; if(i<=n/2) c[i][j]=0; else if(i==n/2+1) c[i][j]=1; else c[i][j]=2; } swap(c[n/2][n/2],c[n/2+1][n/2]); rep(i,n) { rep(j,n) { int k=0; rep(p,2) { rep(q,2) { a[i*2+p][j*2+q]=b[i][j]+d[c[i][j]][k++]; } } } } n=m; } } else if(n%4==0) { int k=1; rep(i,n) { rep(j,n) { int x=i%4,y=j%4; if(x==y || x+y==3) a[i][j]=k; k++; } } k=1; rrep(i,n) { rrep(j,n) { if(!a[i][j]) a[i][j]=k; k++; } } } rep(i,n) { rep(j,n) { if(j) cout << " "; cout << a[i][j]; } cout << endl; } } int main() { ios::sync_with_stdio(0);cin.tie(0);Main(); return 0; }