650. 2 Keys Keyboard

class Solution {
public:
    int minSteps(int n)
    {
        int count = 0;
        for (int i = 2; i <= n; i++)
        {
            while (n % i == 0)
            {
                count += i;
                n /= i;
            }
        }
        return count;
    }
};

• T: O(sqrt(N))
• S: O(1)