#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<int MOD>
class ModInt{
public:
    ModInt():value(0){}
    ModInt(long long val):value((int)(val<0?MOD+val%MOD:val%MOD)){ }

    ModInt& operator+=(ModInt that){
        value = value+that.value;
        if(value>=MOD)value-=MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that){
        value -= that.value;
        if(value<0)value+=MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that){
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that){
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const{
        return ModInt(*this)+=that;
    }
    ModInt operator-(ModInt that) const{
        return ModInt(*this)-=that;
    }
    ModInt operator*(ModInt that) const{
        return ModInt(*this)*=that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const{
        if(value == 0)return 0;
        ModInt n = *this, res = 1;
        while(k){
            if(k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while(b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const{ return value; }

private:
    int value;
};
typedef ModInt<573> mint;
ostream& operator<<(ostream& os, const mint& x){
    os << x.toi();
    return os;
}

string nstr(){
    static const int MAX_LEN = 1001;
    static char res_[MAX_LEN];
    scanf("%s",res_);
    return string(res_);
}

int main(){
    string S = nstr();
    int N = sz(S);

    vi cnt(26);
    each(c, S)cnt[c - 'A']++;

    vi q(N + 1);
    q[N] = 1;
    each(x, cnt)q[x]--;

    for(int i=N-1;i>=2;--i)q[i]+=q[i + 1];
    
    for(int i = N; i >= 4; --i){
        for(int j = 2; j*j <= i; ++j){
            if(i%j==0){
                q[j] += q[i];
                q[i / j] += q[i];
                q[i] = 0;
                break;
            }
        }
    }

    mint ans = 1;
    FOR(i, 2, N + 1)if(q[i])ans *= mint(i).pow(q[i]);
    ans -= 1;
    cout << ans << endl;
}