#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

// Precomputation : O(M log (log M)) (M : MAX)
// Factorize Query : O(log N) (N<=MAX)
template<int MAX>
struct FactorizeQueries{
    vector<int> min_factor;
    
    FactorizeQueries(){
        min_factor.resize(MAX+1);
        iota(begin(min_factor),end(min_factor),0);
        for(int i=2;i*i<=MAX;i++){
            if(min_factor[i]==i)
                for(int j=i+i;j<=MAX;j+=i) min_factor[j]=min(min_factor[j],i);
        }
    }
    
    vector<int> Factorize(int x){
        assert(x<=MAX);
        vector<int> ret;
        for(;x>1;x/=min_factor[x]) ret.push_back(min_factor[x]);
        return ret;
    }
};


const int P = 573;

signed main(){
    FactorizeQueries<1010> F;

    string S; cin >> S;
    int N = (int) S.size();
    vector<int> C(26, 0);
    for(auto &x : S) C[x - 'A']++;

    map<int, int> num;
    for(int i = 1; i <= N; i++){
        for(auto &x : F.Factorize(i)) num[x]++;
    }

    for(auto &den : C){
        for(int i = 1; i <= den; i++)
            for(auto &x : F.Factorize(i)) num[x]--;
    }
    
    int ans = 1;
    for(auto [mul, time] : num){
        rep(_, time) ans = (ans * mul) % P;
    }
    ans = (ans + 572) % P;
    cout << ans << endl;
    return 0;
}