// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

int N, A[310][310];
int main() {
    cin >> N;
    int c = 1, x = 0, y = 0, M = N / 2, half = N*N / 2;
    for(; c<=N*N; c++) {
        A[x][y] = c;
        if(c % 2) {
            if(c > half) x += M, y -= M;
            else x += M, y += M;
        }
        else {
            if(c > half) {
                x -= M, y += M - 1;
                if(y < M) {
                    x++;
                    y = N - 1;
                }
            }
            else {
                x -= M, y -= M - 1;
                if(y >= M) {
                    x++;
                    y = 0;
                }
            }
        }

        if(c == half) {
            x = 0;
            y = N - 1;
        }
    }

    for(int i=0; i<N; i++) {
        for(int j=0; j<N; j++) {
            cout << A[i][j] << " \n"[j + 1 == N];
        }
    }
    return 0;
}