#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <math.h>
using namespace std;
typedef long long int ll;

template<typename T>
map<T,ll> factorize(T x){
    map<T,ll> res;
    for(ll i=2;i*i<=x;i++){
        while(x%i==0){
            x/=i;
            res[i]++;
        }
    }
    if(x!=1) res[x]++;
    return res;
}

int main(){
    ll n; cin >> n;
    auto m=factorize(n);
    ll ans=1;
    for(auto x:m){
        ll k=(pow(x.first,x.second+1)-1)/(x.first-1);
        ans*=k;
    }
    cout << ans << endl;
}