#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<int>> a(n), b(n);
	rep(i, n) {
		a[i].resize(i + 1);
		b[i].resize(i + 1);
	}
	a[0][0] = 1, a[1][0] = 1, a[1][1] = 2;
	b[0][0] = 2, b[1][0] = 1, b[1][1] = 1;
	int sa = 0, sb = 0;
	rep(_, 2) {
		rep2(i, 2, n) {
			rep2(j, 1, n - 1)a[i][j] = 4 - a[i - 1][j - 1] - a[i - 1][j];
			a[i][0] = 4 - a[i][1] - a[i - 1][0];
			a[i][n - 1] = 4 - a[i][n - 2] - a[i - 1][n - 2];
			rep(j, n)sa += a[i][j];
		}
		swap(sa, sb);
		swap(a, b);
	}
	if (sa > sb)swap(a, b);
	rep(i, n) {
		for (auto e : a[i])cout << e << " ";
		cout << endl;
	}
	return 0;
}