#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cassert>
#include <cstdio>
 
using namespace std;

typedef long long ll;

int comb[1919][1919];
void init() {
    comb[0][0] = 1;
    for (int i = 1; i < 1919; i++) {
        comb[i][0] = 1;
        for (int j = 1; j < 1919; j++) {
            comb[i][j] = (comb[i-1][j] + comb[i-1][j-1]);// % 573;
        }
    }
}
int d[26];
int main() {
    init();
    string s;
    cin >> s;
    int n = (int)s.size();
    for (char c: s) {
        d[c-'A']++;
    }
    ll res = 1;
    for (int i = 0; i < 26; i++) {
        res *= comb[n][d[i]];
        n -= d[i];
//        res %= 573;
    }
    cout << res - 1 << endl;
//    cout << (res + 572) % 573 << endl;
    return 0;
}