#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y-1);(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

int comb[2123][2123],MOD=573;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int i,j,k;
  comb[0][0]=1;
  rep(i,2100)rep(j,2100){
    comb[i][j]%=MOD;
    comb[i+1][j]+=comb[i][j];
    comb[i+1][j+1]+=comb[i][j];
  }
  //rep(i,10){rep(j,10)cout<<comb[i][j]<<",";cout<<endl;}
  string str;
  cin>>str;
  int n=str.size();
  vector<int> cnt(26);
  rep(i,n)
    ++cnt[str[i]-'A'];
  int re=1,m=n;
  rep(i,26){
    (re*=comb[m][cnt[i]])%=MOD;
    m-=cnt[i];
  }
  cout<<(re+MOD-1)%MOD<<endl;
  return 0;
}