#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main(){
  string s;
  cin>>s;
  vector<char> v;
  for(int i=0; i<s.size(); ++i){
    v.push_back(s[i]);
  }
  sort(v.begin(),v.end());
  set<string> se;
  do{
    string s2;
    for(int i=0; i<s.size(); ++i){
      s2+=v[i];
    }
    se.insert(s2);
  } while(next_permutation(v.begin(),v.end()));
  cout<<se.size()-1<<endl;
  return 0;
}