#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

ll cmb[9][9];

int main(int argc, char **argv) {
	string S;
	cin >> S;
	map<char, int> cnt;
	REP(i, S.length()) {
		++cnt[S[i]];
	}
	REP(i, 9) cmb[i][0] = 1;
	FOR(i, 1, 9) cmb[0][i] = 0;
	FOR(i, 1, 9) FOR(j, 1, 9) cmb[i][j] = cmb[i - 1][j] + cmb[i - 1][j - 1];
	int n = S.length();
	ll res = 1;
	for (auto it = cnt.begin(); it != cnt.end(); ++it) {
		int c = it->second;
		res *= cmb[n][c];
		n -= c;
	}
	cout << (res - 1) << endl;
	return 0;
}