#include <bits/stdc++.h>
#define lowbit(x) x&(-x)

#define pb push_back

#define pf push_front

#define ll long long

#define forn(i, n) for (int i = 0; i < int(n); i++)

#define FOR(i, s, n) for (int i = int(s); i <= int(n); i++)

#define lc c[x][0]

#define rc c[x][1]

using namespace std;
const ll LL_MAX = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const double pi = 4 * atan(1);
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<int, pair<int, int>> PIII;  //分别表示边的权重 边两顶点
int bitcount(int x) { return x == 0 ? 0 : bitcount(x / 2) + (x & 1); }

inline string strRead() {
    string res;
    char ch = getchar();
    while (ch == ' ' || ch == '\n' || ch == '\t') ch = getchar();
    while (ch != ' ' && ch != '\n' && ch != '\t') res += ch, ch = getchar();
    return res;
}

void solve() {
    string str;
    cin >> str;
    vector<string> mp(10);
    mp[0] = "-----";
    mp[1] = ".----";
    mp[2] = "..---";
    mp[3] = "...--";
    mp[4] = "....-";
    mp[5] = ".....";
    mp[6] = "-....";
    mp[7] = "--...";
    mp[8] = "---..";
    mp[9] = "----.";
    mp[0] = "-----";
    string ans;
    for (char& i : str) {
        ans += mp[i - '0'];
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    //	cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}