I was starting to create an implementation of BigInt that allowed me to multiply and get the modulo of large numbers while storing them as strings. And then I realized that the solution was waaaaaay simpler than that.

I'd say my solution was a little brute forced. I recursively stripped the variable, so each iteration of my loop was faster than the last since it was producing a number that was the log5 of the last