#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"


int main() {
	string N;
	bool flag = false;
	while (cin >> N) {
		if (flag)cout << endl;
		flag = true;
		int num = 5 - N.size();
		for (int i = 0; i < num; ++i) {

			N.insert(N.begin(), '0');
		}
		vector<vector<int>>memo{
			{ 1,0,1,0,1,1,1,1},
			{ 1,0,1,1,0,1,1,1 },
			{ 1,0,1,1,1,0,1,1 },
			{ 1,0,1,1,1,1,0,1 },
			{ 1,0,1,1,1,1,1,0 },
			{ 0,1,1,0,1,1,1,1 },
			{ 0,1,1,1,0,1,1,1 },
			{ 0,1,1,1,1,0,1,1 },
			{ 0,1,1,1,1,1,0,1 },
			{ 0,1,1,1,1,1,1,0 },

		};
		vector<string>field(8, "     ");
		for (int i = 0; i < 5; ++i) {
			for (int j = 0; j < 8; ++j) {
				field[j][i] = j == 2 ? '=' : memo[N[i] - '0'][j] ? '*' : ' ';
			}
		}
		for (int i = 0; i < field.size(); ++i) {
			cout << field[i] << endl;
		}
	}
	return 0;
}