#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int combination(int n, int r) {
    if (n == r || r == 0)
        return 1;
    else
        return combination(n-1,r) + combination(n-1,r-1);
}

int main() {
    int n, ans;
    string s;
    map<char,int> m;
    cin >> s;
    for (auto c : s)
        m[c]++;
    n = s.size();
    ans = 1;
    for (auto p : m) {
        ans *= combination(n,p.second);
        n -= p.second;
    }
    cout << ans - 1 << endl;
    return 0;
}