#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

map<char, int> m;

int main()
{
	string s;
	cin >> s;

	ll ans = 1;
	for (int i = 1; i <= s.size(); i++) {
		ans *= i;
	}
	
	for (int i = 0; i < s.size(); i++) {
		int cnt = 0;
		if (m[s[i]] == 0) {
			m[s[i]] = 1;
 			for (int j = 0; j < s.size(); j++) {
				if (s[i] == s[j])
					cnt++;
			}
			ll fuc = 1;
			for (int j = 1; j <= cnt; j++)
				fuc *= j;
			if(cnt != 0)
			ans /= fuc;
		}
	}
	cout << ans - 1 << endl;
	return	0;
}