#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#include <time.h>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
typedef vector<ll> vll;
typedef vector< vector<ll> > matrix;
#define REP(i, x, y) for(ll i = (ll)x; i < (ll)y; i++)
#define DREP(i, x, y, d) for(ll i = (ll)x; i < (ll)y; i += (ll)d)
#define PER(i, x, y) for(ll i = (ll)x; i > (ll)y; i--)
#define DPER(i, x, y, d) for(ll i = (ll)x; i > (ll)y; i -= (ll)d)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-12;

//「オイラーのふるい」。pnには素数の数が、primesには順番に素数が、
//eulnumsにはその整数を割り切る最小の素数が入る。
//ある数からeulnumsを割っていくとその数の素因数分解が可能。
int pn = 0;
int primes[16000000];
int eulnums[16000000];

void eulerprime(int n) {
    fill(eulnums, eulnums + n + 1, 0);
    for (int i = 2; i <= n; i++) {
        if (eulnums[i] == 0) {
            eulnums[i] = i;
            primes[pn] = i;
            pn++;
        }

        for (int j = 0; i * primes[j] <= n; j++) {
            eulnums[i * primes[j]] = primes[j];
            if (i % primes[j] == 0) {
                break;
            }
        }
    }
}

ll isPrime(ll n) {
    // bool ok = true;
    for (ll i = 2; i * i <= n; i++) {
        if(n % i == 0) {
            return i;
            // ok = false;
        }
    }
    return -1;
}

ll len;
ll ans = 0;
ll N;
vector<ll> pm;
vector<ll> sz;

void solve(ll tmp, ll mark) {
    if (mark == len) {
        if (N / tmp - 1 > tmp) {
            ans += N / tmp - 1;
            //cout << tmp << " " << ans << " aaa" << endl;
        }
    } else {
        ll now = 1;
        REP(i, 0, sz[mark] + 1) {
            solve(tmp * now, mark + 1);
            now *= pm[mark];
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N;
    ll M = N;
    if (N == 1) {
        cout << 0 << endl;
        return 0;
    }
    ll tmp = -1;
    while (isPrime(N) != -1) {
        ll num = isPrime(N);
        if (num != tmp) {
            pm.push_back(num);
            sz.push_back(1);
        } else {
            sz[sz.size() - 1]++;
        }
        tmp = num;
        N /= num;
    }
    if (N != tmp) {
        pm.push_back(N);
        sz.push_back(1);
    } else {
        sz[sz.size() - 1]++;
    }
    len = pm.size();
    // REP(i, 0, len) {
    //     cout << pm[i] << " " << sz[i] << endl;
    // }
    N = M;
    solve(1, 0);
    // ll sq = 0;
    // while (sq * sq <= N) {
    //     sq++;
    // }
    // ll ans = 0;
    // REP(i, 1, sq) {
    //     if (N % i == 0) {
    //         ans += (N / i) - 1;
    //     }
    // }
    cout << ans << endl;
}


Measured memory_bytes: 256