#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cctype>
#include<complex>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
#include<numeric>
#define INF 1e+8
#define EPS 1e-8
#define PB push_back
#define fi first
#define se second
#define reps(i,j,k) for(int i = j; i < k; i++)
#define rep(i,j) reps(i,0,j)
using namespace std;
const int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
typedef long long ll;
typedef pair<int,int> Pii;

int main(){
	string data;
	vector< string > type;
	type.PB("* = ****");
	type.PB("* =* ***");
	type.PB("* =** **");
	type.PB("* =*** *");
	type.PB("* =**** ");
	type.PB(" *= ****");
	type.PB(" *=* ***");
	type.PB(" *=** **");
	type.PB(" *=*** *");
	type.PB(" *=**** ");

	bool flg = false;
	while(cin >> data){
		vector < string > ans;
		string sub="";
		if(flg)puts("");
		rep(i,5-data.size())sub+="0";
		sub += data;
		swap(sub,data);
		rep(i,5){
			ans.PB(type[data[i]-48]);
		}
		rep(i,8){
			rep(j,5){
				cout << ans[j][i];
			}
			puts("");
		}
		flg = true;
	}
	return 0;
}