Problem: <image>


At the request of a friend who started learning abacus, you decided to create a program to display the abacus beads. Create a program that takes a certain number as input and outputs a row of abacus beads. However, the number of digits of the abacus to be displayed is 5 digits, and the arrangement of beads from 0 to 9 is as follows using'*' (half-width asterisk),''(half-width blank), and'=' (half-width equal). It shall be expressed as.

<image>



Input

Multiple test cases are given. Up to 5 digits (integer) are given on one line for each test case.

The number of test cases does not exceed 1024.

Output

Output the abacus bead arrangement for each test case. Insert a blank line between the test cases.

Example

Input

2006
1111


Output

****
    *
=====
 *  *
****
* ***
*****
*****

*****

=====
 ****
*
*****
*****
*****

Solution (in CPP):

Solution:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    int n;
    bool c = false;
    while(cin >> n){
        if(c)cout << endl;
        c = true;
        vs s(8,"     ");
        rep(i,5){
            if(n%10 >= 5)s[1][4-i] = '*';
            else s[0][4-i] = '*';
            s[2][4-i] = '=';
            switch (n%5) {
                case 0: s[4][4-i] = s[5][4-i] = s[6][4-i] = s[7][4-i] = '*';break;
                case 1: s[3][4-i] = s[5][4-i] = s[6][4-i] = s[7][4-i] = '*';break;
                case 2: s[3][4-i] = s[4][4-i] = s[6][4-i] = s[7][4-i] = '*';break;
                case 3: s[3][4-i] = s[4][4-i] = s[5][4-i] = s[7][4-i] = '*';break;
                case 4: s[3][4-i] = s[4][4-i] = s[5][4-i] = s[6][4-i] = '*';break;
            }
            n /= 10;
        }
        rep(i,8)cout << s[i] << endl;
    }

}