# your code goes here
#swap
S=list(input())
S.sort()
i=0
k=1
l=1
while i<len(S)-1:
    if S[i]==S[i+1]:
        k*=2
        j=2
        i+=1
        l*=i
        while i<len(S)-1 and S[i]==S[i+1]:
            j+=1
            k*=j
            i+=1
            l*=i
    else:
        i+=1
        l*=i
i+=1
l*=i
l//=k
print(l-1)