//#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<numeric>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<ctype.h>
#include <fstream>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
using namespace std;
typedef long long ll;//int64
typedef unsigned long long ull;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int dy[4]={0,1,0,-1};
//----------program from here----------

int main(){
  int fact[9]={1,1,2,6,24,120,720,5040,40320},num[26]={},ans=0;
  string s;
  cin >> s;
  ans = fact[s.length()];
  for(int i=0;i<s.length();i++) num[s[i]-'A']++;
  ans=fact[s.length()];
  for(int i=0;i<26;i++) ans/=fact[num[i]];
  cout << ans-1 << endl;
}