import sys
input=lambda: sys.stdin.readline().rstrip()
S=input()
n=len(S)
n_max=n
D=[0]*26
for s in S:
  D[ord(s)-65]+=1

def ans(mod):
  
  F,FI=[0]*(n_max+1),[0]*(n_max+1)
  F[0],FI[0]=1,1
  for i in range(n_max):
    F[i+1]=(F[i]*(i+1))%mod
  FI[n_max-1]=pow(F[n_max-1],mod-2,mod)
  for i in reversed(range(n_max-1)):
    FI[i]=(FI[i+1]*(i+1))%mod
  ret=F[n]
  for i in range(26):
    ret=(ret*FI[D[i]])%mod
  return (ret-1)%mod

if max(D)==n:
  print(0)
else:
  ans1,ans2=ans(3),ans(191)
  for i in range(573):
    if i%3==ans1 and i%191==ans2:
      print(i)
      break