In Haskell (and maybe other languages), random tests may generate 0 as a value for n. While this shouldn't be a problem for languages where the standard library has a product function, a 7 kyu solver may not have the intuition that the product of 0 numbers is 1. Perhaps the description should clarify this, or tests should be generated so that n >= 1.

python translation