#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;


int main(){
    string s, tmp = "";
    int n;
    cin >> s;
    n = s.size();
    vector<int> v(n);
    set<string> st;
    for (int i = 0; i < n; i++) v[i] = i;
    do{
       for (int i = 0; i < n; i++) tmp += s[v[i]];
       st.insert(tmp);
       tmp = "";
    }while(next_permutation(v.begin(), v.end()));
    cout << st.size() - 1 << endl;
}