#include #define pb push_back #define mp make_pair #define fi first #define se second #define MOD 1000000007 #define gc getchar_unlocked #define ms(s, n) memset(s, n, sizeof(s)) #define prec(n) fixed<>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;} ll inv(ll a, ll p = MOD) {return fpow(a, p - 2, p);} //https://www.youtube.com/watch?v=4AqjqOqNrjw ll prime[1000003]; int main() { ios::sync_with_stdio(0); for(ll i=2;i*i<=1000000;i++){ if(prime[i]==0){ for(ll j=2*i;j<=1000000;j+=i){ prime[j]=1; } } } ll n; cin>>n; ll sum=0; for(ll i=0;i>p; if(p==1){ sum+=1; continue; } sum+=p; for(ll j=2;j*j<=p;j++){ if(p%j==0){ p=p/j; sum+=p; j=1; } } sum+=1; } cout<