#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;

typedef istringstream ISS;
typedef ostringstream OSS;
typedef vector<string> VS;
typedef int INT;
typedef vector<INT> VI;
typedef vector<VI> VVI;
typedef pair <INT, INT> II;
typedef vector <II> VII;

template<class T> ostream& operator << ( ostream& os, vector<T> v ) {
    for ( typename vector<T>::iterator it_i = v.begin(); it_i != v.end(); ++it_i ) {
        os << *it_i << ", ";
    }
    return os;
}


string s;
int n;
int A[6];
int B[6];
char T[8][6];

void solve() {
    for ( int i = 0; i < 8; ++ i ) {
        for ( int j = 0; j < 5; ++ j ) {
            T[i][j] = '*';
        }
        T[i][5] = '\0';
    }
    for ( int i = 0; i < 5; ++ i ) {
        T[2][i] = '=';
    }

    for ( int i = 0; i < n; ++ i ) {
        int k = s[i] - '0';
        if ( k >= 5 ) A[i] = 0;
        else A[i] = 1;
        B[i] = k % 5;
    }

    for ( int i = 0; i < n; ++ i ) {
        T[A[i]][i] = ' ';
        T[3+B[i]][i] = ' ';
    }
}

void output() {
    for ( int i = 0; i < 8; ++ i ) {
        cout << T[i] << endl;
    }
}

string addPrefix( string s ) {
    while ( s.size() < 5 ) {
        s = "0" + s;
    }
    return s;
}

int main() {
    bool flag = true;
    while ( cin >> s ) {
        if ( ! flag ) cout << endl;
        flag = false;
        s = addPrefix(s);
        n = s.size();
        solve();
        output();
    }
    return 0;
}