#include<vector>
#include<map>
#include<climits>
#include<set>
#include<queue>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<string>
#include<bitset>
#include<cstring>
#include<list>
#include<iterator>
using namespace std;
typedef vector<string>vs;
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef pair<int,int>pii;
typedef long long ll;
typedef pair<ll,ll>pll;
#define rrep(i,x,n) for(int i=(x);i<(n);++i)
#define rep(i,x) rrep(i,0,(x))
#define fi first
#define se second
#define each(i,c) for(typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back

ll cmb[1100][1100];
const ll mod=573;
int main(){

    for(int i=0;i<=1000;i++){
        cmb[i][0]=cmb[i][i]=1;
        for(int j=1;j<i;j++)cmb[i][j]=(cmb[i-1][j]+cmb[i-1][j-1])%mod;
    }

    string str;
    cin>>str;
    ll cnt[26]={0};
    rep(i,str.size())cnt[str[i]-'A']++;

    ll ans=1;
    ll sum=str.size();
    //cout<<"latte"<<endl;
    rep(i,26){
        ans=(ans*cmb[sum][cnt[i]])%mod;
        sum-=cnt[i];
        //cout<<sum<<endl;
    }
    cout<<(ans+mod-1)%mod<<endl;
    return 0;
}