Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

In fact, this is a very easy problem with Prime factorization.

What ever the number n is, the minimum number of steps is sums of all the prime factor of number n.

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.