class
GFG
{
static
long
factorial(
long
n)
{
long
res =
1
;
for
(
int
i =
1
; i <= n; i++)
res = res * i;
return
res;
}
static
long
count(String word)
{
int
freq[] =
new
int
[
27
];
for
(
int
i=
0
;i<
27
;i++)
freq[i]=
0
;
long
vowel =
0
, consonant =
0
;
for
(
int
i =
0
; i < word.length(); i++) {
freq[word.charAt(i) -
'A'
]++;
if
(word.charAt(i) ==
'A'
|| word.charAt(i) ==
'E'
|| word.charAt(i) ==
'I'
|| word.charAt(i) ==
'O'
|| word.charAt(i) ==
'U'
) {
vowel++;
}
else
consonant++;
}
long
vowelArrange;
vowelArrange = factorial(vowel);
vowelArrange /= factorial(freq[
0
]);
vowelArrange /= factorial(freq[
4
]);
vowelArrange /= factorial(freq[
8
]);
vowelArrange /= factorial(freq[
14
]);
vowelArrange /= factorial(freq[
20
]);
long
consonantArrange;
consonantArrange = factorial(consonant);
for
(
int
i =
0
; i <
26
; i++) {
if
(i !=
0
&& i !=
4
&& i !=
8
&& i !=
14
&& i !=
20
)
consonantArrange /= factorial(freq[i]);
}
long
total = vowelArrange * consonantArrange;
return
total;
}
public
static
void
main(String []args)
{
String word =
"COMPUTER"
;
long
ans = count(word);
System.out.println(ans);
}
}