#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const int mod=573;
int extgcd(int a, int b, int& x, int& y)
{
    int d=a;
    if (b) {
        d=extgcd(b, a%b, y, x);
        y-=a/b*x;
    }
    else {
        x=1;
        y=0;
    }
    return d;
}
int inv(int a)
{
    int x, y;
    extgcd(a, mod, x, y);
    return (mod+x%mod)%mod;
}
int main()
{
    string s;
    cin>>s;
    int a[256]={}, f[600]={};
    f[0]=1;
    for(int i=1;i<600;++i) f[i]=f[i-1]*i%mod;
    for(char c: s) a[c]++;
    int res=f[s.size()];
    for(int v: a) if (v) res=res*inv(f[v])%mod;
    res=(res-1+mod)%mod;
    cout<<res<<endl;
}