#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int ncr[1001][1001];

void nCr(int n, int r, int mod) {
	REP(i, n + 1) {
		REP(j, i + 1) {
			if (j == 0 || j == i) ncr[i][j] = 1;
			else ncr[i][j] = ncr[i - 1][j - 1] + ncr[i - 1][j] % mod;
		}
	}
}

int main() {
	int mod = 573;
	
	string s; cin >> s;
	
	nCr(s.size(), s.size(), mod);
	
	int cnt[26] = {};
	REP(i, s.size()) cnt[s[i] - 'A']++;
	
	int ans = 1;
	
	int now = s.size();
	REP(i, 26) {
		ans = ans * ncr[now][cnt[i]] % mod;
		now -= cnt[i];
	}
	ans = (ans + mod - 1) % mod;
	
	cout << ans << endl;
	
	return 0;
}