#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

char s[10];
string str;
map<string,bool> found;

bool used[10] = {};
int dfs(string str2,int how){
	if(how == str.size()){
		if(found.find(str2) == found.end()){
			found[str2] = true;
			return 1;
		}
		return 0;
	}
	int sum = 0;

	for(int i = 0;i < str.size();i++){
		if(used[i]) continue;
		used[i] = true;
		sum += dfs(str2 + s[i],how + 1);
		used[i] = false;
	}
	return sum;
}

int main() {
	cin >> str;
	found[str] = true;
	for(int i = 0;i < str.size();i++){
		s[i] = str[i];
	}
	cout << dfs("",0) << endl;
	return 0;
}