#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>

using namespace std;

#define rep(i,n) for(int i = 0; i < (n); i++)

typedef long long ll;
typedef long double lld;

const int MOD = 1000000007;
const lld PI = 3.14159265358979;

double f (double a , double b) {
    if (a > b) return b;
    else return a;
}

int main () {
    cout << fixed << setprecision(15);
    string s;
    cin >> s;
    map<string , int> mp;
    sort(s.begin() , s.end());
    do {
        mp[s]++;
    } while (next_permutation(s.begin(), s.end()));
    cout << mp.size() - 1 << endl;
    return 0;
}