#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
static const double EPS = 1e-5;

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)

int main(void){
  string num;
  map<char,string> data;
  data['0'] = "* = ****";
  data['1'] = "* =* ***";
  data['2'] = "* =** **";
  data['3'] = "* =*** *";
  data['4'] = "* =**** ";
  data['5'] = " *= ****";
  data['6'] = " *=* ***";
  data['7'] = " *=** **";
  data['8'] = " *=*** *";
  data['9'] = " *=**** ";
  bool f=false;
  while(cin>>num){
    if(f){
      cout<<endl;
    }else{
      f = true;
    }
    while(num.size()!=5) num.insert(0,"0");
    vector<string> soroban;
    REP(i,num.size()){
      soroban.push_back(data[num[i]]);
    }
    REP(y,soroban[0].size()){
      REP(x,soroban.size()){
        cout<<soroban[x][y];
      }
      cout<<endl;
    }
  }

  return 0;
}