#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

struct ExtendedSieve{
    vector<int> table;
    const int n;

    ExtendedSieve(int n) : n(n) {
        table.assign(n + 1, 0);
        table[0] = table[1] = 1;
        for(int i = 2; i <= n; ++i){
            if(table[i] > 0)    continue;
            table[i] = i;
            for(int j = i + i; j <= n; j += i){
                if(table[j] == 0)   table[j] = i;
            }
        }
    }

    int operator[](const int& k){
        return table[k];
    }

    bool is_prime(int x){
        if(x < 2)   return false;
        return x == table[x];
    }

    map<int, int> prime_factorization(int x){
        map<int, int> res;
        while(x > 1){
            ++res[table[x]];
            x /= table[x];
        }
        return res;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s;
    cin >> s;
    int n = s.length();
    vector<int> cnt(26);
    for(int i = 0; i < n; ++i){
        cnt[s[i] - 'A'] += 1;
    }

    ExtendedSieve sieve(n);
    vector<map<int, int>> primes(n + 1);
    for(int i = 1; i <= n; ++i){
        primes[i] = sieve.prime_factorization(i);
        for(auto& [prime, cnt] : primes[i - 1]){
            primes[i][prime] += cnt;
        }
    }
    auto fact = primes[n];
    for(int i = 0; i < 26; ++i){
        for(auto& [prime, cnt] : primes[cnt[i]]){
            fact[prime] -= cnt;
        }
    }
    
    constexpr int M = 573;
    ll ans = 1;
    for(auto& [prime, cnt] : fact){
        for(int i = 0; i < cnt; ++i){
            (ans *= prime) %= M;
        }
    }
    cout << (ans + M - 1) % M << endl;

    return 0;
}