Codeforce Round #211 Div2 A

A. Soroban

time limit per test 1 second

memory limit per test 256 megabytes

You know that Japan is the country with almost the largest 'electronic devices per person' ratio. So you might be quite surprised to find out that the primary school in Japan teaches to count using a Soroban — an abacus developed in Japan. This phenomenon has its reasons, of course, but we are not going to speak about them. Let's have a look at the Soroban's construction.

 

Soroban consists of some number of rods, each rod contains five beads. We will assume that the rods are horizontal lines. One bead on each rod (the leftmost one) is divided from the others by a bar (the reckoning bar). This single bead is called go-dama and four others are ichi-damas. Each rod is responsible for representing a single digit from 0 to 9. We can obtain the value of a digit by following simple algorithm:

• Set the value of a digit equal to 0.
• If the go-dama is shifted to the right, add 5.
• Add the number of ichi-damas shifted to the left.

 

Thus, the upper rod on the picture shows digit 0, the middle one shows digit 2 and the lower one shows 7. We will consider the top rod to represent the last decimal digit of a number, so the picture shows number 720.

Write the program that prints the way Soroban shows the given number n.

Input

The first line contains a single integer n (0 ≤ n < 10⁹).

Output

Print the description of the decimal digits of number n from the last one to the first one (as mentioned on the picture in the statement), one per line. Print the beads as large English letters 'O', rod pieces as character '-' and the reckoning bar as '|'. Print as many rods, as many digits are in the decimal representation of number n without leading zeroes. We can assume that number 0 has no leading zeroes.

Sample test(s)

Input

2

Output

O-|OO-OO

Input

13

Output

O-|OOO-O O-|O-OOO

Input

720

Output

O-|-OOOO O-|OO-OO -O|OO-OO

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 1055
#define ll long long
#define mod 1000000007
#define INF 0x7fffffff
#define eps 1e-8
int n, m, k, sx, sy;
int a[maxn];
int b[maxn];
int main(){
    //int t;
    //scanf("%d", &t);
    //while (t--){
    //memset(a, 0, sizeof a);
    //memset(b, 0, sizeof b);
    scanf("%d", &n);
    int i = 0;
    memset(a, 0, sizeof a);
    if (n == 0){ printf("O-|-OOOO\n"); return 0; }
    while (n){
        a[i++] = n % 10;
        n /= 10;
    }
    for (int j = 0; j < i; j++){
        if (a[j] < 5)printf("O-|");
        else printf("-O|");
        a[j] = a[j] % 5;
        if (a[j] == 0)printf("-OOOO\n");
        if (a[j] == 1)printf("O-OOO\n");
        if (a[j] == 2)printf("OO-OO\n");
        if (a[j] == 3)printf("OOO-O\n");
        if (a[j] == 4)printf("OOOO-\n");
    }
    return 0;
}