from collections import defaultdict, deque

def isP(s):
    return "".join(reversed(s)) == s
def outsideM(f, s):
    m = min(map(len, [f, s]))
    # return 
    # print(f, "$", s)
    # print(f[:len(s)], "$",  (''.join(reversed(s))))
    return f[:m] == ''.join(reversed(s))[:m]
def insideM(f, s):
    return outsideM(s, f)

morseRaw = {
    "A": ".-",
    "B": "-...",
    "C": "-.-.",
    "D": "-..",
    "E": ".",
    "F": "..-.",
    "G": "--.",
    "H": "....",
    "I": "..",
    "J": ".---",
    "K": "-.-",
    "L": ".-..",
    "M": "--",
    "N": "-.",
    "O": "---",
    "P": ".--.",
    "Q": "--.-",
    "R": ".-.",
    "S": "...",
    "T": "-",
    "U": "..-",
    "V": "...-",
    "W": ".--",
    "X": "-..-",
    "Y": "-.--",
    "Z": "--..",
    "0": "-----",
    "1": ".----",
    "2": "..---",
    "3": "...--",
    "4": "....-",
    "5": ".....",
    "6": "-....",
    "7": "--...",
    "8": "---..",
    "9": "----.",
}
moseRev = {v: k for k,v in morseRaw.items()}
morseSym =  set(morseRaw.values())
morse = defaultdict(lambda: "", morseRaw)

def getMorse(s):
    return "".join([morse[c] for c in s])

word = input()
p = getMorse(word)
# print(word, p)

if isP(p):
    print(0)
    quit()

def shortest(m):
    r = len(m) + 1
    dp = [500] * r
    short = [None] * r
    dp[0] = 0
    short[0] = ""

    for i in range(1, r):
        for b in range(1, min(5, i)+1):
            seg = m[(i-b):i]
            # print(r, dp)
            if seg in morseSym:
                # print("seg", seg, i-b, i)
                if dp[i-b] + 1 < dp[i]:
                    dp[i] = dp[i-b] + 1
                    short[i] = short[i-b] + moseRev[seg]
                    # print('seg', seg, i, dp[i], dp[i-b])
    
    # print(m, short[-1])
    # print(short)
    return short[-1]

sa = None
for d in range((len(p))//2, len(p)+1):
    if insideM(p[:d], p[d:]) and len(p[:d]) >= len(p[d:]): 
        rev = p[:2*d-len(p)][::-1]
        gen = shortest(rev)
        if not sa or len(gen) < len(sa):
            # print(gen)
            sa = gen
    if insideM(p[:d], p[d+1:]):
        rev = p[:2*d-len(p)+1][::-1]
        # print(d, rev)
        gen = shortest(rev)
        if not sa or len(gen) < len(sa):
            # print(gen)
            sa = gen

print(len(sa), sa)

"""

a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
q = deque()

q.append("")
while q:
    n = q.popleft()
    # print(n, q)
    for c in a:
        suff = c + n
        m = getMorse(suff)
        if not outsideM(p, m):
            continue
        # print("Valid outside")
        if isP(p + m):
            print(len(suff), suff)
            quit()
        q.append(suff)
"""