Problem 2: Scrabble Tiles
2 Points

Suppose you have a set of scrabble tiles, and want to consider every distinct way of rearranging them. 
How many possibilities will you have to consider? For example, you can form exactly 720 different strings 
from the six tiles spelling PENCIL. Your program must repeatedly input strings of characters, and for each 
string output the number of possible distinct rearrangements of the characters. All inputs will be strings of 
uppercase letters. End of input will be indicated by the string Z (for which no output is needed).

Example:

Input
AB
COW
ESSCAAR
Z

Output
2
6
1260