#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 573;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 2;

int f(int n, int p) {
	if (n == 0) return 0;
	return n / p + f(n / p, p);
}

int main() {
	string S; cin >> S;
	int n = S.length();
	vector<int> a(26);
	for (int i = 0; i < n; i++)
		a[S[i] - 'A']++;
	vector<bool> p(1001, true);
	p[0] = p[1] = false;
	for (int i = 2; i <= 1000; i++)
		if (p[i])
			for (int j = i * 2; j <= 1000; j += i)
				p[j] = false;
	map<int, int> m;
	for (int i = 0; i <= 1000; i++)
		if (p[i])
			m[i] = f(n, i);
	for (int j = 0; j < 26; j++)
		for (int i = 0; i <= 1000; i++)
			if (p[i])
				m[i] -= f(a[j], i);
	int ans = 1;
	for (auto it = m.begin(); it != m.end(); it++) {
		int x = it->first, y = it->second;
		while (y--) ans = ans * x % MOD;
	}
	cout << (ans + MOD - 1) % MOD << endl;
}