#include <stdio.h>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>


template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;


int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int n; cin >> n;
	vector<vector<int>> a(n, vector<int>(n));
	for (int i = 0; i < n; i++) a[i][i] = i + 1;
	for (int i = 0; i < n; i++) {
		{
			int h = i;
			int w = i;
			for (; h >= 0 and w < n; h--, w++) {
				a[h][w] = i + 1;
			}
		}
		{
			int h = i;
			int w = i;
			for (; h < n and w >= 0; h++, w--) {
				a[h][w] = i + 1;
			}
		}
	}
	{
		int cur = a[n - 1][0] + 1;
		for (int i = 0; i < n; i++) {
			if (a[i][0] == 0) {
				a[i][0] = cur;
				int h = i;
				int w = 0;
				for (; h >= 0 and w < n; h--, w++) {
					a[h][w] = cur;
				}
				cur++;
			}
		}
	}
	{
		int cur = 1;
		for (int i = 0; i < n; i++) {
			if (a[n - 1][i] == 0) {
				a[n - 1][i] = cur;
				int h = n - 1;
				int w = i;
				for (; h >= 0 and w < n; h--, w++) {
					a[h][w] = cur;
				}
				cur++;
			}
		}
	}
	for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cout << a[i][j] << " \n"[j + 1 == n];
}