#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))

static int const MOD = 573;
static int const COMBI_MAX = 1002;
static int combi[COMBI_MAX][COMBI_MAX];

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

int main() {
	string s;
	cin >> s;
	int n = s.size();
	rep(i, n) { cnts[s[i] - 'A'] ++; }

	rep(i, COMBI_MAX) repi(j, 0, i/2 + 1) {
		combi[i][j] = combi[i][i - j] =
			(i == 0 || j == 0) ? 1
			: (combi[i - 1][j] + combi[i - 1][j - 1]) % MOD;
	}

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