#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()

using namespace std;

typedef unsigned int uint;
typedef long long ll;

const char *data[10]={
  "* = *****",
  "* =* ****",
  "* =** ***",
  "* =*** **",
  "* =**** *",
  " *= *****",
  " *=* ****",
  " *=** ***",
  " *=*** **",
  " *=**** *",
};

int main(){
  int n;
  int cc = 0;
  while(cin>>n){
    char buff[8][6] = {{0}};
    if(cc++ != 0) puts("");
    REP(i,5){
      int d = n % 10;
      //printf("d = %d, data[d] = %s\n",d,data[d]);
      REP(j,8){
        buff[j][4-i] = data[d][j];
        //printf("buff = %c\n",buff[j][5-i]);
      }
      n/=10;
    }
    REP(i,8) puts(buff[i]);
  }
}