650

class Solution {
public:
    int minSteps(int n) {
        int ans = 0, div=2;
        while(n>1){
            while(n%div == 0){
                ans += div;
                n  /= div;
            }
            div++;
        }
        return ans;
    }
};

-----------------------
class Solution {
public:
    int minSteps(int n) {
        int dp[n+1];
        dp[1] = 0;

        for(int i=2; i<=n; i++){
            dp[i] = i;
            for(int j=i/2; j>1; j--)
                if(i%j == 0)
                    dp[i] = min(dp[i], dp[j] + (i/j));
        }
        return dp[n];
    }
};