//by SUZUKI
// March 23 2005
// from www.ricardosuzuki.com
 

#include <iostream>
#include <string>

using namespace std;

string line1(int size, char number)
{
	switch(number)
	{
	case '1':
	case '6':
	case '4':
		return "   ";
		break;
	case '0':
	case '2':
	case '3':
	case '5':
	case '7':
	case '8':
	case '9':
		return " _ ";
		break;
	}
	return "";
}
string line2(int size, char number)
{
	switch(number)
	{
	case '0':
		return "| |";
		break;
	case '4':
	case '8':
	case '9':
		return "|_|";
		break;
	case '1':
		return" | ";
		break;
	case '2':
	case '3':
		return " _|";
		break;
	case '7':
		return "  |";
		break;
	case '5':
	case '6':
		return "|_ ";
		break;
	}
	return "";
}
string line3(int size, char number)
{
	switch(number)
	{
	case '0':
	case '6':
	case '8':
		return "|_|";
		break;
	case '1':
		return " | ";
		break;
	case '2':
		return "|_ ";
		break;
	case '3':
		return " _|";
		break;
	case '5':
		return " _|";
		break;
	case '7':
	case '9':
	case '4':
		return "  |";
		break;
	}
	return "";
}
string space(string & str)
{
	return (str += " ");
}

int main()
{
	char letters[20];
	int many = 0;

	// 20 the the most
	while( cin.peek() != '\n' && many < 20)
		cin>>letters[many++];

	string l1 = "";
	string l2 = "";
	string l3 = "";

	for( int i =0; i<many; i++)
	{
		l1 += space(line1(1,letters[i]));
		l2 += space(line2(1,letters[i]));
		l3 += space(line3(1,letters[i]));
	}

	cout <<l1<<endl;
	cout <<l2<<endl;
	cout <<l3<<endl;

	return 0;
}