#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 573;
const double eps = 1e-8;
const double pi = acos(-1);

string s;
map<int, int> pf;

void prime_factor(int n) {
    for (int i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            pf[i]++;
            n /= i;
        }
    }
    if (n != 1) pf[n]++;
}

void prime_factor_dev(int n) {
    for (int i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            pf[i]--;
            n /= i;
        }
    }
    if (n != 1) pf[n]--;
}

int solve() {
    int l = s.size();
    int num[26];
    memset(num, 0, sizeof(num));
    for (int i = 0; i < l; i++) num[s[i]-'A']++;

    for (int i = 2; i <= l; i++) {
        prime_factor(i);
    }
    for (int i = 0; i < 26; i++) {
        for (int j = 2; j <= num[i]; j++)
            prime_factor_dev(j);
    }

    int res = 1;
    for (auto v : pf) {
        int k = v.first;
        for (int i = 0; i < v.second; i++) {
            res *= k;
            res %= mod;
        }
    }
    return (res-1+mod)%mod;
}

void input() {
    cin >> s;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}