#include <bits/stdc++.h>
using namespace std;
int factorial(int p)
{
if (p == 0)
return 1;
else
return(p * factorial(p-1));
}
int main()
{
char ppk[10];
cin >> ppk;
int N[26]={0};
int j=0;
while(ppk[j]!='\0')
{
N[ppk[j]-'a']++;
j++;
}
int permutat;
permutat=factorial(strlen(ppk));
for(int i=0;i<26;i++)
{
if(N[i]>=2)
{
permutat=permutat/factorial(N[i]);
}
}
cout << permutat;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBmYWN0b3JpYWwoaW50IHApICAKeyAgCiAgaWYgKHAgPT0gMCkgIAogICAgcmV0dXJuIDE7ICAKICBlbHNlICAKICAgIHJldHVybihwICogZmFjdG9yaWFsKHAtMSkpOyAgCn0gCmludCBtYWluKCkKewogIGNoYXIgcHBrWzEwXTsKICBjaW4gPj4gcHBrOwogIGludCBOWzI2XT17MH07CiAgaW50IGo9MDsKICB3aGlsZShwcGtbal0hPSdcMCcpCiAgewogICAgTltwcGtbal0tJ2EnXSsrOwogICAgaisrOwogIH0KICBpbnQgcGVybXV0YXQ7CiAgcGVybXV0YXQ9ZmFjdG9yaWFsKHN0cmxlbihwcGspKTsKICBmb3IoaW50IGk9MDtpPDI2O2krKykKICB7CiAgICBpZihOW2ldPj0yKQogICAgewogICAgICBwZXJtdXRhdD1wZXJtdXRhdC9mYWN0b3JpYWwoTltpXSk7CiAgICB9CiAgfQogIGNvdXQgPDwgcGVybXV0YXQ7CiAgcmV0dXJuIDA7Cn0=