#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n, a, b, c;
  cin >> n >> a >> b >> c;
  vector<string> ans(n, string(n, '.'));
  if (a >= n) {
    rep(i,0,n*n) {
      if (i < b) ans[i/n][i%n] = '2';
      else if (i < b+a) ans[i/n][i%n] = '1';
      else ans[i/n][i%n] = '3';
    }
  } else if (c >= n) {
    rep(i,0,n*n) {
      if (i < b) ans[i/n][i%n] = '2';
      else if (i < b+c) ans[i/n][i%n] = '3';
      else ans[i/n][i%n] = '1';
    }
  } else if (a == c) {
    rep(i,0,n) rep(j,0,n) ans[i][j] = '2';
    rep(j,0,a) ans[0][j] = '1', ans[1][j] = '3';
  } else if (a < c) {
    rep(i,0,n) rep(j,0,n) ans[i][j] = '2';
    rep(j,0,a) ans[0][j] = '1';
    ans[0][a] = '3';
    rep(j,0,c-1) ans[1][j] = '3';
  } else {
    rep(i,0,n) rep(j,0,n) ans[i][j] = '2';
    rep(j,0,c) ans[0][j] = '3';
    ans[0][c] = '1';
    rep(j,0,a-1) ans[1][j] = '1';
  }
  rep(i,0,n) cout << ans[i] << endl;
  return 0;
}