#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <utility>

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define DEBUG(x) cout<<#x<<": "<<x<<endl

using namespace std;

typedef pair<int,int> P;
typedef long long int LL;

int co[26];

int comb(int n,int r);

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	string s;
	cin>>s;
	REP(i,SZ(s)){
		co[s[i]-'A']++;
	}
	int n=SZ(s);
	int ans=1;
	REP(i,26){
		ans*=comb(n,co[i]);
		n-=co[i];
	}
	cout<<ans-1<<endl;
	return 0;
}

int comb(int n,int r)
{
	int res=1;
	REP(i,r){
		res*=(n-i);
	}
	REP(i,r){
		res/=(i+1);
	}
	return res;
}