LeetCode - 2 Keys Keyboard

public int minSteps(int n) {
    if (n == 1) return 0;
    int res = n;
    for (int i = n - 1; i > 1; --i) {
        if (n % i == 0) {
            res = Math.min(res, minSteps(n / i) + i);
        }
    }
    return res;
}