Given a positive integer K > 2, with prime
factorization:

K = p1^a1 * p2^a2 ... * pn^an

Compute the following:

S = a1*p1 + a2*p2 ... + an*pn.

-----Input-----
A list of <100 integers, one on each line,
all less than $2*10^{18}$.

-----Output-----
For each integer compute the super factor
sum and output it on a single line.

-----Example-----
Input:
6
7
Output:
5
7

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import random\nimport os\nyash=(2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997)\n\ndef fix(m):\n    for ai in yash:\n        if m%ai==0:\n            return ai\n    return m\n\ndef rabin_miller(a,i,n):\n    if i==0:\n        return 1\n    x=rabin_miller(a,i/2,n)\n    if x==0:\n        return 0\n    y=(x*x)%n\n    if (y==1)and(x!=1)and(x!=n-1):\n        return 0\n    if i%2!=0:\n        y=(a*y)%n\n    return y\n\ndef gcd(x,y):\n    if y==0:\n        return x\n    return gcd(y,x%y)\n\ndef brent_rho(n):\n    if (n<=3)or(rabin_miller(random.randint(2,n-2),n-1,n)==1):\n        return n\n    y,r,q,m=1,1,1,203\n    while 1:\n        x=y\n        for i in range(1,r+1):\n            y=(y*y+1)%n\n        k=0\n        while 1:\n            ys=y\n            for i in range(1,min(m,r-k)+1):\n                y=(y*y+1)%n\n                q=(q*abs(x-y))%n\n            g=gcd(q,n)\n            k+=m\n            if (k>=r)or(g>1):\n                break\n        r*=2\n        if g>1:\n            break\n    if g==n:\n        while 1:\n            ys=(ys*ys+1)%n\n            g=gcd(abs(x-ys),n)\n            if g>1:\n                break\n    if g==n:\n        return n\n    return brent_rho(g)\n\ndef divsum2(n):\n    if n==1:\n        return 0\n    d=brent_rho(n)\n    d=fix(d)\n    assert (d<=3)or(rabin_miller(random.randint(2,d-2),d-1,d)==1)\n    f,m=0,n\n    while m%d==0:\n        m/=d\n        f = f + 1;\n    return (f*d)+(divsum2(m))\n\ntry:\n    while(1):\n\t    z=eval(input())\n\t    print(divsum2(z))\nexcept:\n\tos.sys.exit(0);\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 268583