#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<int>x(3);
	rep(i, 3)cin >> x[i];
	if (n == 2) {
		if (x[0] == 2) {
			// 1123
			cout << "21" << endl;
			cout << "13" << endl;
		}
		if (x[1] == 2) {
			// 1223
			cout << "22" << endl;
			cout << "13" << endl;
		}
		if (x[2] == 2) {
			// 1233
			cout << "13" << endl;
			cout << "32" << endl;
		}
		return 0;
	}
	vector ans(n, vector<int>(n));
	vector<int>v;
	if (x[2] > n) {
		v = { 1,3,2 };
	}
	else if (x[0] > n) {
		v = { 2,1,3 };
	}
	else if (x[1] > n) {
		v = { 1,2,3 };
	}
	else {
		// 333
		v = { 2,1,3 };
	}
	int idx = 0;
	rep(i, 3) {
		rep(j, x[v[i] - 1]) {
			ans[idx / n][idx % n] = v[i];
			idx++;
		}
	}
	rep(i, n) {
		rep(j, n)cout << ans[i][j];
		cout << endl;
	}
	assert(n != 3);
	return 0;
}