#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
typedef pair<int, int> PII;

ifstream fin("DATA1.txt");
ofstream fout("OUT1.txt");

char map[100][100];
int s[5];
int width[5];
int best;
int start[5];
int w;

void draw(int t)
{
	int x, y;
	for (y=best+1; y>(best-s[t]+1); y--)
		for (x=(start[t]-s[t]+1+best+1-y); x<(start[t]+s[t]-1-best+y); x++)
			map[y][x] = 'x';
}

int main()
{
	int x, y;
	for (x=0; x<5; x++)
		fin >> s[x];

	w = 0;
	for (x=0; x<5; x++)
	{
		width[x] = (s[x] == 0? 1 : 2*s[x]-1);
		w += (s[x] == 0? 1 : 2*s[x] - 1);
	}


	best = -1;
	for (x=0; x<5; x++)
		if (s[x] > best)
			best = s[x];

	memset(map, '.', sizeof map);

	for (x=0; x<5; x++)
	{
		start[x] = 0;
		for (y=0; y<x; y++)
			start[x] += width[y];

		start[x] += s[x] == 0? 1 : s[x];
	}

	for (x=0; x<5; x++)
		draw(x);

	for (x=1; x<=best+1; x++)
	{
		for (y=1; y<=w; y++)
			fout << map[x][y];
		fout << endl;
	}

	return 0;
}