#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
using mint = modint;
string s;
int cnt[26];
const int MAX_N = 2000;
mint fac[MAX_N],facinv[MAX_N];
mint biomv[2000][2000];
void init(){
	biomv[0][0] = 1;
	for(int i = 1;i<MAX_N;i++){
		biomv[i][0] = 1;
		for(int j = 1;j<MAX_N;j++){
			biomv[i][j] = biomv[i-1][j-1]+biomv[i-1][j];
		}
	}
}

mint biom(int n,int k){
	if(n<k)return 0;
	if (n < 0 || k < 0) return 0;
	return biomv[n][k];
}

void solve(){
	init();
	for(auto &c:s){
		cnt[c-'A'] ++;
	}
	mint ans = 1;
	int cur = s.size();
	for(int i = 0;i<26;i++){
		ans *= biom(cur,cnt[i]);
		cur -= cnt[i];
	}
	ans--;
	cout<<ans.val()<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> s;
	mint::set_mod(573);
	solve();
}