Given a sequence of letters, we replace each letter with its position in the alphabet, and then we compute the product of all the numbers. For example, if the sequence was HAL, then we get the numbers 8, 1, 12 (because H, A, L are the eight, first, twelfth letters of the alphabet, respectively), and their product is 96. Find the smallest composite three-digit number that cannot be the result of computing this product for any sequence of letters.
