#include <bits/stdc++.h>

#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz=" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = 1e9 + 7;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

constexpr ll MAX = (ll)(2e12);
constexpr ll SQRT = 2000000;
bool isprime[SQRT];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    fill(isprime, isprime + SQRT, true);
    for (ll i = 2; i < SQRT; i++) {
        if (isprime[i]) {
            for (ll j = 2; i * j < SQRT; j++) {
                isprime[i * j] = false;
            }
        }
    }
    vector<ll> prime;
    for (ll i = 2; i * i <= MAX; i++) {
        if (isprime[i]) {
            prime.push_back(i);
        }
    }

    ll N;
    cin >> N;
    if (N % 2 == 0) {
        N /= 2;
    }
    ll sum = 1;
    for (ll p : prime) {
        ll prod = 1;
        while (N % prod == 0) {
            prod *= p;
        }
        N = N * p / prod;
        sum *= ((prod - 1) / (p - 1));
    }
    if (N > 1) {
        sum *= (N + 1);
    }
    cout << sum << endl;

    return 0;
}