#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int main() {
	string s;
	cin >> s;
	vector<char> v(SZ(s));
	REP(i, SZ(s)) {
		v[i] = s[i];
	}
	sort(ALL(v));
	REP(i, SZ(s)) {
		s[i] = v[i];
	}
	set<string> st;
	do {
		st.insert(s);
	} while (next_permutation(ALL(s)));
	cout << st.size() - 1 << endl;
	return 0;
}