from collections import *

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])
 
    if temp != 1:
        arr.append([temp, 1])

    return arr

S = [ord(s) - ord("A") for s in input()]
N = len(S)
C = Counter(S)
M = 1005
L = [0] * M
for i in range(N, 1, -1):
    for k, v in factorization(i):
        L[k] += v

for _, v1 in C.items():
    for i in range(v1, 1, -1):
        for k, v in factorization(i):
            L[k] -= v

mod = 573
ans = 1
for i in range(2, M):
    for j in range(L[i]):
        ans *= i
        ans %= mod

print((ans-1)%mod)