#include<stdio.h>
#include<stdlib.h>
#include<math.h>

typedef long long int int64;

#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))

#define POS(i,j) ((i)*(n+1)+(j))

void run(void){
  const int mod=573;
  char s[1001];
  scanf("%s",s);
  int n=0;
  while(s[n]!='\0') n++;
  int c[26];
  int i;
  for(i=0;i<26;i++) c[i]=0;
  for(i=0;i<n;i++) c[s[i]-'A']++;
  int *comb=(int *)calloc((n+1)*(n+1),sizeof(int));
  comb[POS(0,0)]=1;
  for(i=1;i<=n;i++){
    comb[POS(i,0)]=1;
    int j;
    for(j=1;j<=i;j++){
      comb[POS(i,j)]=(comb[POS(i-1,j-1)]+comb[POS(i-1,j)])%mod;
    }
  }
  int ans=1;
  int t=n;
  for(i=0;i<26-1;i++){
    ans=ans*comb[POS(t,c[i])]%mod;
    t-=c[i];
  }
  ans=(ans-1+mod)%mod;
  printf("%d\n",ans);
  return;
}

int main(void){
  run();
  return 0;
}