/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.05.28 01:44:35
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

// 素因数分解 O(√n)以下
// (素因数,個数)
template<typename T>
vector<pair<T,int>> prime_factorization(T n) {
    vector<pair<T, int>> res;
    for (T i = 2; i*i <= n; i++) {
        int cnt = 0;
        while (n % i == 0) {
            n /= i;
            cnt++;
        }
        if (cnt > 0) res.push_back({i,cnt});
    }
    if (n > 1) res.push_back({n,1});
    return res;
}
//pow
template<typename T, typename U>
T _pow(T k, U n, T unity = 1) {
    while (n > 0) {
        if (n & 1) {
            unity *= k;
        }
        k *= k;
        n >>= 1;
    }
    return unity;
}
int main() {
    ll n;cin >> n;
    if (n & 1) {
        auto p = prime_factorization(n);
        ll ans = 1;
        for(auto q : p) {
            ll sum = 0;
            ll now = 1;
            for(int i = 0; i <= q.second; i++) {
                sum += now;
                now *= q.first;
            }
            ans *= sum;
        }
        cout << ans << endl;
    }
    else {
        auto p = prime_factorization(n);
        ll ans = 1;
        for(auto q : p) {
            if (q.first == 2) q.second--;
            ll sum = 0;
            ll now = 1;
            for(int i = 0; i <= q.second; i++) {
                sum += now;
                now *= q.first;
            }
            ans *= sum;
        }
        cout << ans << endl;
    }
    return 0;
}