#include "bits/stdc++.h" using namespace std; #define REP(i, n) for(int i=0; i<(n); i++) #define RREP(i, n) for(int i=(n-1); i>=0; i--) #define ALL(a) (a).begin(),(a).end() int pymod(int i, int j) { return (i % j + j) % j; } int N,T; string S; map M; int mod = 573; signed main() { cin >> S; REP(i,S.size()) M[S[i]]++; vector mul; vector div; int k = 0; for (auto&& kv : M) { REP(i,kv.second) { mul.push_back(++k); div.push_back(i+1); } } sort(ALL(mul), greater()); sort(ALL(div), greater()); for (auto&& d : div) { REP(i,mul.size()) { if (mul[i] % d == 0) { mul[i] /= d; break; } } } int ret = 1; for (auto&& m : mul) { ret *= m % mod; ret %= mod; } cout << pymod(ret - 1, mod) << endl; return 0; }