#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include //#include //#include //#include //#include //#include //#include //#include //#include //#if __cplusplus >= 201103L //#include //#include //#include //#include //#include //#include // //#define cauto const auto& //#else //#endif using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; typedef vector vint; typedef vector > vvint; typedef vector vll, vLL; typedef vector > vvll, vvLL; #define VV(T) vector > template void initvv(vector > &v, int a, int b, const T &t = T()){ v.assign(a, vector(b, t)); } template void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #define reep(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) reep((i),0,(n)) #define ALL(v) (v).begin(),(v).end() #define PB push_back #define F first #define S second #define mkp make_pair #define RALL(v) (v).rbegin(),(v).rend() #define MOD 573 #define EPS 1e-8 static const int INF=1<<24; // #define int long long int com[1001][1001]; void mainmain(){ string s; cin>>s; vint v(26,0); rep(i,s.size()){ v[s[i]-'A']++; } int n=s.size(); com[0][0]=1; com[1][1]=1; com[1][0]=1; reep(i,2,1001){ rep(j,i+1){ if(j==0){ com[i][j]=1; continue; } com[i][j]=com[i-1][j]+com[i-1][j-1]; com[i][j]%=MOD; } } int ans=1; rep(i,26){ if(v[i]==0) continue; int t=com[n][v[i]]; n-=v[i]; // cout<