#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
const LL mod = 573;
LL cdp[1001][501];
LL ccc(int n,int k){
	if(k<0){
		return 0;
	}
	else if( n < k){
		return 0;
	}
	//0<=k<=n
	
	k = min(k,n-k);

	if(k==0){
		return 1;
	}
	else if( k == 1){
		return n;
	}
	else if( cdp[n][k] != 0){
		return cdp[n][k];
	}

	////////
	LL ans = 0;
	ans = ( ccc(n-1,k-1) + ccc(n-1,k) )%mod;
	cdp[n][k] = ans;
	return ans;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(10);//

	string str;
	cin>>str;
	int N = str.size();
	int s[26];
	rep(i,26)s[i]=0;
	rep(i,N){
		++s[ str[i] - 'A' ];
	}
	sort(s,s+26);
	LL ans=1;
	int nokori = N;
	rep(i,26){
		ans *= ccc( nokori,s[i] );
		ans %= mod;//mod
		nokori -= s[i];
	}
	P(ans-1);
    return 0;
}