//
//  main.cpp
//  Q409
//
//  Created by AkihiroKOBAYASHI on 7/6/15.
//  Copyright (c) 2015 Akhr5884. All rights reserved.
//

#include <iostream>

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

int main(int argc, const char * argv[]) {
    using namespace std;
    
    string value;
    int kind;
    int i, j, count;
    
    cin >> value;
    kind = factorial((int)value.size());
    
    for(i = 0; i < value.size(); i++) {
        count = 1;
        for(j = i+1; j < value.size(); j++) {
            if(value[i] == value[j]) {
                count++;
            }
        }
        kind = kind / count;
    }
    kind = kind -1;
    cout << kind << "\n";
    return 0;
}