#include <bits/stdc++.h>
using namespace std;
using ll = long long;

map<ll, int> prime_factor(ll N){
    map<ll, int> res;
    while (N%2 == 0){
        N /= 2;
        res[2]++;
    }
    for (int p = 3; p*p <= N; p += 2){
        while (N%p == 0){
            N /= p;
            res[p]++;
        }
    }
    if (N > 1) res[N]++;
    return res;
}

int main(){
    ll N;
    cin >> N;
    auto P = prime_factor(N);

    ll ans = 1;
    for (auto [k, v] : P){
        ll sm = 1, pw = 1;
        for (int i = 0; i < v; i++){
            pw *= k;
            sm += pw;
        }
        ans *= sm;
    }

    cout << ans << endl;
}