Given a number n, find x such that x! = n, where both x and n are positive integers. Assume the input n will always be the factorial of a positive integer, so something like n=23 will not be given as input.
n=1 -> x=1 (0 is not a positive integer),
n=24 -> x=4
Shortest code wins.