#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

map<char, string> m;

pair<ll, string> solve(string s) {
    ll n = s.size();
    ll dp[n + 1] = {};
    char prev[n + 1] = {};
    fill_n(dp, n + 1, 1e9);
    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        for (auto p : m) {
            string cur = p.second;
            reverse(cur.begin(), cur.end());
            if (i + cur.size() - 1 >= n)
                continue;
            bool valid = true;
            for (int j = 0; j < cur.size(); j++)
                valid &= s[i + j] == cur[j];
            if (valid && dp[i + cur.size()] > dp[i] + 1) {
                dp[i + cur.size()] = dp[i] + 1;
                prev[i + cur.size()] = p.first;
            }
        }
    }
    string ans = "";
    ll cur = n;
    while (cur > 0) {
        ans += prev[cur];
        cur -= m[prev[cur]].size();
    }
    return {dp[n], ans};
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    m['A'] = ".-";
    m['B'] = "-...";
    m['C'] = "-.-.";
    m['D'] = "-..";
    m['E'] = ".";
    m['F'] = "..-.";
    m['G'] = "--.";
    m['H'] = "....";
    m['I'] = "..";
    m['J'] = ".---";
    m['K'] = "-.-";
    m['L'] = ".-..";
    m['M'] = "--";
    m['N'] = "-.";
    m['O'] = "---";
    m['P'] = ".--.";
    m['Q'] = "--.-";
    m['R'] = ".-.";
    m['S'] = "...";
    m['T'] = "-";
    m['U'] = "..-";
    m['V'] = "...-";
    m['W'] = ".--";
    m['X'] = "-..-";
    m['Y'] = "-.--";
    m['Z'] = "--..";
    m['0'] = "-----";
    m['1'] = ".----";
    m['2'] = "..---";
    m['3'] = "...--";
    m['4'] = "....-";
    m['5'] = ".....";
    m['6'] = "-....";
    m['7'] = "--...";
    m['8'] = "---..";
    m['9'] = "----.";
    string s;
    getline(cin, s);
    string t = "";
    for (char c : s)
        t += m[c];
    ll k = 0;
    for (int i = 1; i <= t.size(); i++) {
        string s1 = "";
        for (int j = 0; j < i; j++)
            s1 += t[ll(t.size()) - j - 1];
        string s2 = s1;
        reverse(s2.begin(), s2.end());
        if (s1 == s2)
            k = i;
    }
    for (int i = 0; i < k; i++)
        t.pop_back();
    auto ans = solve(t);
    if (k == 0) {
        t.push_back('-');
        auto p1 = solve(t);
        t.pop_back();
        t.push_back('.');
        auto p2 = solve(t);
        ll mn = min(p1.first, p2.first);
        pair<ll, string> ans;
        if (mn == p1.first) ans = p1;
        if (mn == p2.first) ans = p2;
    }
    cout << ans.first << " " << ans.second;
}