#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']++;
	}

	vector<int> primes = getPrimes(n);
	vector<int> element(n + 1, 0);

	for (int i = 2; i <= n; i++) {
		int tmp = i;
		for (int j = 0; j < primes.size() && tmp > 1; j++) {
			while (tmp % primes[j] == 0) {
				element[primes[j]]++;
				tmp /= primes[j];
			}
		}
	}

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

	int ans = 1;
	for (int i = 0; i < element.size(); i++) {
		if (element[i] == 0) {
			continue;
		}
		for (int j = 0; j < element[i]; j++) {
			ans = (ans * i) % MOD;
		}
	}

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