#include <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

inline int factorial(int n) {
    if (n == 1) return 1;
    return n * factorial(n-1);
}

int main() {
    string s;
    cin >> s;
    map<char, int> c;
    REP(i, s.length()) {
        c[s[i]]++;
    }
    int a = 0, b = 1;
    for (map<char, int>::iterator it = c.begin(); it != c.end(); it++) {
        a += it->second;
        b *= factorial(it->second);
    }
    cout << (factorial(a) / b) - 1 << endl;
}