#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

int kaijo(int x) {
  int ret = 1;
  for (int i = 1; i <= x; i++) {
    ret *= i;
  }
  return ret;
}

int main() {
  string str;
  cin >> str;
  int alnum['z'-'a'+1];
  memset(alnum, 0, sizeof(alnum));
  for (int i = 0; i < str.size(); i++) {
    alnum[str[i]-'A']++;
  }
  int cnt = kaijo(str.size());
  for (int i = 0; i < 'z'-'a'+1; i++) {
    cnt /= kaijo(alnum[i]);
  }
  std::cout << cnt-1 << std::endl;
}