#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

ull power( const ull& a, ull k, const ull& n )
{
  if ( a == 0 || n == 0 ) return( 0 );
  if ( k == 0 ) return( 1 % n );

  ull currentMod = a % n;
  ull currentValue = ( ( k & 1 ) > 0 ) ? currentMod : 1;

  for ( k >>= 1 ; k > 0 ; k >>= 1 ) {
    currentMod = ( currentMod * currentMod ) % n;
    if ( ( k & 1 ) > 0 )
      currentValue = ( currentValue * currentMod ) % n;
  }

  return( currentValue );
}

int main(void)
{
    const int MDD=573;
    int a[26]={0};
    string s;
    cin>>s;
    int n=s.size();
    rep(i,n){
        a[s[i]-'A']++;
    }
    int k[1010]={1};
    REP(i,1,n+1)k[i]=i;
    rep(i,26){
        int w[]={3,191};
        rep(wi,2)
        for(int j=w[wi];j<=a[i];j+=w[wi])
            for(int x=n;x>=0;x-=w[wi])
                if(k[x]%w[wi]==0){
                    k[x]/=w[wi];
                    break;
                }
    }
    ll res=1;
    REP(i,1,n+1){
        res=(res*k[i])%MDD;
        //write(k[i]);
    }
    //cout<<endl;
    rep(i,26){
        REP(j,1,a[i]+1){
            int tj=j;
            while(tj%3==0)tj/=3;
            while(tj%191==0)tj/=191;
            //write(tj);
            //write(power(tj,MDD-1,MDD));
            res=(res*power(tj,MDD-4,MDD))%MDD;
        }
    }
    //write(power(5,MDD-3,MDD));
    write((res+MDD-1)%MDD);
    return 0;
}