#include <cmath>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
#define repi(_I, _B, _E) for(int _I = (_B); (_I) < (_E); ++ (_I))
#define rep(_I, _N) for(int _I = 0; (_I) < (_N); ++ (_I))

typedef long long ull;
static ull const MOD = 573;

ull combi(ull a, ull b) {
	if ( a == b || a == 0 || b == 0 ) return 1;
	if ( b == 1 ) return a;
	
	static ull t[1000 + 1][1000+1];
	return ( t[a][b] )
		? t[a][b]
		: (t[a][b] = t[a][a - b] = ((a > 0 ? combi(a - 1, b) : 0) + (a > 0 && b > 0 ? combi(a - 1, b - 1) : 0)) % MOD);
}

int cnts['Z' - 'A' + 1];

int main() {
	string s;
	cin >> s;
	int n = 0;
	rep(i, s.size()) {
		char c = s[i];
		if ( 'A' <= c && c <= 'Z' ) {
			cnts[c - 'A'] ++;
			n++;
		}
	}

	int m = n;
	ull res = 1;
	rep(i, 26) {
		int r = cnts[i];
		res = (res * combi(m, r)) % MOD;
		m -= r;
	}
	cout << (res - 1) << endl;
	return 0;
}