#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    string S;
    cin >> S;
    int a[26] = {0};
    int n = S.length();
    for ( int i = 0; i < n; i++ ) {
        a[S[i]-'A']++;
    }
    long long ans = 1;
    while ( n ) {
        ans *= n;
        n--;
    }

    long long d = 1;
    for ( int i = 0; i < 26; i++ ) {
        int x = a[i];
        long long y = 1;
        while ( x ) {
            y *= x;
            x--;
        }
        d *= y;
    }
    ans /= d;
    ans--;
    cout << ans << endl;

    return 0;
}