#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <sstream>

using namespace std;

vector<long long> spf;
map<long long, long long> prime;

void osa_k(long long n){
    spf.resize(n+1);
    for (long long i=0; i<=n; i++) spf[i] = i;
    for (long long i=2; i*i<=n; i++){
        if (spf[i] == i){
            for (long long j=2; i*j <= n; j++){
                spf[i*j] = min(spf[i*j], i);
            }
        }
    }
}

map<long long, map<long long, long long>> mp;

void prime_factor(long long n){
    long long m=n;
    while(n != 1){
        prime[spf[n]]++;
        n /= spf[n];
    }
    mp[m] = prime;
}

long long mod_exp(long long b, long long e, long long m){
    if (b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0){
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b*b) % m;
    }

    return ans;
}

int main(){
    osa_k(1000);

    for (int i=2; i<=1000; i++) prime_factor(i);

    long long ans=1;
    string S;
    cin >> S;
    vector<long long> cnt(26);
    for (auto x : S) cnt[x-'A']++;
    for (int i=0; i<26; i++){
        for (auto &[x, y] : mp[cnt[i]]){
            mp[S.size()][x] -= y;
        }
    }

    for (auto &[x, y] : mp[S.size()]) ans = (ans * mod_exp(x, y, 573)) % 573;
    cout << (573+ans-1)%573 << endl;

    return 0;
}