class Solution {
public:
    int pf (int n) {
        int p = n;
        int out = 0;
        while (p % 2 == 0) { // 
            p /= 2;
            out += 2 ;
        }
        int sqt = sqrt(p);
        for (int i =3 ;i<=sqt ;i+=2) {
            while (p%i == 0) {
                p = p/i;
                out += i;
    
            }
        }
        if (p>2) {
            out = out+p;
        }
        return out;
    }

    int smallestValue(int n) {
        int p = n;
        while (1) {
            int a = pf (p) ;
            std::cout<< "Output: "<< a <<std::endl;
            if (a == p){
                return p;
            }
            else {
                p=a;
            }
        }
    }

    /**
    => 15 
    => 3 * 5 => 8
    => 2 * 2 * 2 => 6
    => 2 * 3 => 5 (is_prime ).
  
    */
};