#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string s; cin >> s; int f[26] = {}; rep(i,s.size())f[s[i] - 'A']++; int n = s.size(); int ans = 1; srep(i,1,n+1)ans *= i; rep(i,26){ if(f[i] > 1){ srep(j,1,f[i]+1)ans /= j; } } cout << ans - 1 << endl; return 0; }