#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <utility>

typedef long long ll;
using namespace std;

typedef pair<int, int> P;



int main() {

	string s;
	cin>>s;

	string sf =s.substr(1);

	string sb =s.substr(0,s.size()-1);

	set<string> a_set,b_set;

	do{

		a_set.insert(sf);

	}while(next_permutation(sf.begin(),sf.end()));


	do{

		b_set.insert(sb);

	}while(next_permutation(sb.begin(),sb.end()));


/*	set<string>::iterator itr;
    for(itr = a_set.begin(); itr != a_set.end(); ++itr) {
        std::cout << *itr << "\n";

        b_set.insert(*itr);
    }

    for(itr = b_set.begin(); itr != b_set.end(); ++itr) {
        std::cout << *itr << "\n";
    }*/

    cout<<b_set.size()<<endl;


	return 0;
}