#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;
//const bool debug = false;
#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 endl "\n"
#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() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<int>> a(n, vector<int>(n, 0));
	a[1][0] = 1;
	rep2(i, 1, n) a[1][i] = 2;
	rep(i, n - 2) {
		int x = 2 * i + 2;
		if (0 == i % 2)x++;
		rep(j, n - 2) {
			int y = 0;
			if (x >= 2)y = 2;
			else if (x >= 1)y = 1;
			x -= y;
			a[2 + i][2 + j] = y;
		}
	}
	rep(i, n) {
		rep(j, n) {
			cout << a[i][j];
		}
		cout << endl;
	}
	return 0;
}