#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <list>
#include <cmath>

using namespace std;

const int MOD = 573;

template <class T>
vector<bool> getIsPrime(T n) {
	vector<bool> p(n + 1, true);
	p[0] = p[1] = false;

	T limit = sqrt(n);
	for (T i = 4; i <= n; i += 2) {
		p[i] = false;
	}
	for (T i = 3; i <= limit; i++) {
		if (p[i]) {
			for (T j = i * i; j <= limit; j += i) {
				p[j] = false;
			}
		}
	}

	return p;
}

template <class T>
vector<T> getPrimes(T n) {
	auto isPrime = getIsPrime(n);
	vector<T> primes((n + 1) / 2, 0);
	auto it = primes.begin();
	for (T i = 2; i <= n; i++) {
		if (isPrime[i]) {
			*it = i;
			it++;
		}
	}
	primes.erase(it, primes.end());
	return primes;
}

int main() {
	string s;

	cin >> s;
	vector<int> alpha(26, 0);

	int n = s.size();
	char c;
	for (int i = 0; i < n; i++) {
		alpha[s[i] - 'A']++;
	}

	int exist = 0;
	for (int i = 0; i < alpha.size(); i++) {
		if (alpha[i] > 0) {
			exist++;
		}
	}

	if (exist == 1) {
		cout << 0 << endl;
		return 0;
	}

	vector<int> primes = getPrimes(n);

	list<int> product;
	for (int i = 2; i <= n; i++) {
		product.push_back(i);
	}

	list<int> devide;
	for (int i = 0; i < alpha.size(); i++) {
		for (int j = alpha[i]; j > 1; j--) {
			int tmp = j;
			int k = 0;
			while(tmp > 1) {
				for (; k < primes.size(); k++) {
					while (tmp % primes[k] == 0) {
						devide.push_back(primes[k]);
						tmp /= primes[k];
					}
				}
			}
		}
	}

	devide.sort(greater<int>());

	for (auto itd = devide.begin(); itd != devide.end(); itd++) {
		for(auto itp = product.begin(); itp != product.end(); itp++) {
			if (*itp %= *itd) {
				*itp /= *itd;
				if (*itp == 1) {
					devide.erase(itp);
				}
				break;
			}
		}
	}

	int ans = 1;
	for(auto itp = product.begin(); itp != product.end(); itp++) {
		ans = (ans * *itp) % MOD;
	}

	ans = (ans + MOD - 1) % MOD;
	cout << ans << endl;
	return 0;
}