#include <bits/stdc++.h>
using namespace std;
bool isprime(int n) {
  for (int i = sqrt(n); i > 1; i--) {
    if (n % i == 0) return false;
  }
  return true;
}
bool is_int(long double d) {
  if (d == ceil(d)) return true;
  return false;
}
long long fact(int x) {
  if (x == 0 || x == 1)
    return 1;
  else
    return x * fact(x - 1);
}
long long ncr(long long n, long long r) {
  return (fact(n) / (fact(r) * fact(n - r)));
}
long long gcd(long long n, long long m) {
  if (n % m == 0) return m;
  if (n < m) swap(n, m);
  while (m > 0) {
    n = n % m;
    swap(n, m);
  }
  return n;
}
bool isPowerOfTwo(int n) {
  if (n == 0) return false;
  return (ceil(log2(n)) == floor(log2(n)));
}
int binary_search(int x, int low, int high, int arr[]) {
  if (low == high)
    return low;
  else {
    int mid = (low + high) / 2;
    if (arr[mid] == x)
      return mid;
    else if (arr[mid] > x)
      return binary_search(x, low, mid - 1, arr);
    else
      return binary_search(x, mid + 1, high, arr);
  }
  return -1;
}
bool is_lucky(long long x) {
  bool flag = false;
  if (x < 0) x = x * (-1);
  while (x > 0) {
    int a = x % 10;
    if (a == 8) {
      flag = true;
      break;
    }
    x = x / 10;
  }
  return flag;
}
void solve() {
  int x;
  cin >> x;
  if (x == 0) {
    cout << "O-|-OOOO";
  } else {
    while (x > 0) {
      int a = x % 10;
      if (a >= 5) {
        cout << "-O|";
        int b = a - 5;
        for (long long i = 0; i < b; i++) {
          cout << "O";
        }
        cout << "-";
        int c = 4 - b;
        for (long long i = 0; i < c; i++) {
          cout << "O";
        }
      } else {
        cout << "O-|";
        for (long long i = 0; i < a; i++) {
          cout << "O";
        }
        cout << "-";
        int c = 4 - a;
        for (long long i = 0; i < c; i++) {
          cout << "O";
        }
      }
      cout << "\n";
      x = x / 10;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int q = 1;
  while (q--) {
    solve();
  }
}
