#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 573;

ll C[2020][2020];
ll dp[2020][2020]; // pos, len

int main() {
	string s;
	cin >> s;

	vector<int> f(26);
	rep (i, s.length()) f[s[i] - 'A']++;

	C[0][0] = 1;
	rep2 (i, 1, 2000) {
		C[i][0] = 1;
		rep2 (j, 1, 2000) {
			C[i][j] = C[i - 1][j - 1] + C[i - 1][j];	
			C[i][j] %= mod;
		}
	}

	dp[0][0] = 1;
	rep (i, 26) {
		rep (j, 1010) {
			rep (k, f[i] + 1) {
				dp[i + 1][j + k] += dp[i][j] * C[j + k][k];
				dp[i + 1][j + k] %= mod;
			}
		}
	}

	ll ans = dp[26][s.length()];
	ans = (ans + mod - 1) % mod;
	cout << ans << endl;

	return 0;
}