#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 main() {
	string s;
	cin >> s;
	
	int cnt[1001] = {};
	FOR(i, 2, s.size() + 1) {
		int now = i;
		
		for (int j = 2; j * j <= i; j++) {
			while (now % j == 0) {
				cnt[j]++;
				now /= j;
			}
		}
		
		cnt[now]++;
	}
	
	int c[26] = {};
	REP(i, s.size()) c[s[i] - 'A']++;
	
	REP(i, 26) {
		FOR(j, 2, c[i] + 1) {
			int now = j;
			
			for (int k = 2; k * k <= j; k++) {
				while (now % k == 0) {
					cnt[k]--;
					now /= k;
				}
			}
			
			cnt[now]--;
		}
	}
	
	int ans = 1;
	FOR(i, 2, s.size() + 1) REP(j, cnt[i]) ans = ans * i % 573;
	cout << (ans + 572) % 573 << endl;
	
	return 0;
}