mod = 573
class PascalsTriangle:
    def __init__(self, N, mod):
        self.mod = mod
        self.tri = [[0] * (N+1) for _ in range(N+1)]
        for i in range(N+1):
            for j in range(i+1):
                if j == 0 or j == i:
                    self.tri[i][j] = 1
                else:
                    self.tri[i][j] = (self.tri[i-1][j] + self.tri[i-1][j-1]) % self.mod

    def comb(self, n, r):
        if n < r or r < 0:
            return 0
        return self.tri[n][r]

S = input()
N = len(S)
T = PascalsTriangle(N, mod)
ans = 1
for i in range(26):
    c = S.count(chr(i+65))
    ans *= T.comb(N, c)
    ans %= mod
    N -= c
print((ans-1)%mod)