#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int, int>

#define MOD 1000000007
#define INF 1012345678
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

int fact(int n) {
    if (n <= 1) return 1;
    return fact(n - 1)*n;
}

int main() {
    string S;
    cin >> S;
    map<char, int> M;
    for (int i = 0; i < S.length(); i++)
    {
        M[S[i]]++;
    }
    int ans = fact(S.length());
    for (auto itr = M.begin(); itr != M.end(); itr++)
    {
        ans /= fact(itr->second);
    }
    cout << ans - 1 << endl;
    getchar(); getchar();
    return 0;
}