#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define CLR(a) memset((a), 0 ,sizeof(a)) #define MCLR(a) memset((a), -1 ,sizeof(a)) #define SZ(a) (sizeof(a)) #define FILL(a,v) fill((int*)a,(int*)(a+(SZ(a)/SZ(*(a)))),v) bool cheak(int x, int y, int xMax, int yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; } const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 }; const int INF = 2147483647; typedef pair P; typedef long long ll; typedef unsigned long long ull; const int mod = 573; const int MAX = 1010; long long c[MAX][MAX]; map ma; int main() { vector vec; string s; cin >> s; int n = s.length(); for (int i = 0;i < n;i++) ma[s[i]]++; for (auto i : ma) vec.push_back(i.second); c[0][0] = c[1][1] = c[1][0] = 1; for (int i = 2; i < MAX; i++) { for (int j = 0; j <= i; ++j) { long long l = j >= i ? 0 : c[i - 1][j]; long long r = j > 0 ? c[i - 1][j - 1] : 0; c[i][j] = (l + r) % mod; } } int ans = 1; int val[2] = { n, vec[0]}; for (int i = 1; i < vec.size(); i++){ ans = (ans * c[val[0]][val[1]]) % mod; val[0] -= vec[i-1]; val[1] = vec[i]; } cout << ans-1 << endl; return 0; }