#include <iostream>
#include <map>

using namespace std;

long long sum(map<long long, long long>::const_iterator itBegin,
              map<long long, long long>::const_iterator itEnd,
              long long base) {
    if (itBegin == itEnd) {
        return base;
    }
    map<long long, long long>::const_iterator itNext = itBegin;
    ++itNext;
    long long result = 0;
    long long powered = 1;
    for (long long i = 0; i <= itBegin->second; ++i) {
        result += sum(itNext, itEnd, base * powered);
        powered *= itBegin->first;
    }
    return result;
}

int main(int argc, const char * argv[]) {
    long long n;
    cin >> n;
    map<long long, long long> factors;
    for (long long divider = 2; divider <= n; ++divider) {
        while (n % divider == 0) {
            ++factors[divider];
            n /= divider;
        }
    }
    cout << sum(factors.begin(), factors.end(), 1) << endl;
    return 0;
}