#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF = 10000000;
using namespace std;
typedef long long  ll;
/** Problem0128 : Abacus **/
int main()
{
	string list[10];
	list[0] = "* = ****";
	list[1] = "* =* ***";
	list[2] = "* =** **";
	list[3] = "* =*** *";
	list[4] = "* =**** ";
	list[5] = " *= ****";
	list[6] = " *=* ***";
	list[7] = " *=** **";
	list[8] = " *=*** *";
	list[9] = " *=**** ";
	
	string n;
	string ans[5];
	bool first=true;
	
	while (cin>>n) {
		rep(i, 5) ans[i] = list[0];
		rep(i, n.length()) {
			ans[5-n.length()+i] = list[n[i]-'0'];
		}

		if (first) {
			first = false;
		} else {
			cout << endl;
		}
		rep(x, 8) {
			rep(y, 5) {
				cout << ans[y][x];
			}
			cout << endl;
		}
	}
}