S = input()
def solve():
    l = len(S)
    if 1 > l or l > 32:
        return False
    if S[0] in ['_', '-']:
        return False
    if S[-1] in ['_', '-']:
        return False
    s = set(S)
    t = set('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_-')
    return s.issubset(t)

if solve():
    print(200)
else:
    print(400)