Here is a task: You need to write a function that takes 2 integers and calculates the factorial of the first number and returns how many zeroes there will be at the end of that factorial at the radix represented by the second number.

For example, for an input (4, 12), the function will return 1, because 4! will be 24 and 24 at radix 12 will be 20.

Acceptable range for a number is from 1 to 1,000,000 and for a radix range is from 1 to 256.

Simplest way to do this task is to calculate factorial and count how many times we can divide factorial by radix without reminder. Obviously that factorial from 1,000,000 is a really