from collections import Counter


def combi(n):
    c = [[0 for i in range(n + 1)] for j in range(n + 1)]
    for x in range(n + 1):
        c[x][0] = 1
        for y in range(1, x + 1):
            c[x][y] = (c[x - 1][y] + c[x - 1][y - 1])
    return c


def solve():
    S = input()
    L = len(S)

    mod = 573

    C = combi(L)

    co = Counter(S)

    ans = 1

    for n in co.values():
        ans *= C[L][n]
        L -= n

    print((ans - 1) % mod)


if __name__ == '__main__':
    solve()