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

#define int long long
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto& i : (arr))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << '\n'
#define dump2(x, y) \
    cerr << #x << " = " << (x) << " " << #y << " = " << (y) << '\n'

template <typename T>
using pq = priority_queue<T>;
template <typename T>
using pqr = priority_queue<T, vector<T>, greater<T>>;
const int INF = LLONG_MAX / 2;
constexpr int MOD = 1e9 + 7;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vec>;

template <typename T1, typename T2>
ostream& operator<<(ostream& stream, const pair<T1, T2>& p) {
    return stream << p.first << " " << p.second;
}
template <typename T>
void print(const vector<vector<T>> matrix) {
    repall (vec, matrix)
        print(vec);
}
template <typename T>
void print(const vector<T> vec) {
    unsigned int len = vec.size();
    rep (i, len - 1)
        cout << vec[i] << ' ';
    cout << vec[len - 1] << '\n';
}
template <typename Arg>
void print(const Arg arg) {
    cout << arg << '\n';
}
template <typename Head, typename... Args>
void print(const Head head, const Args... args) {
    cout << head << " ";
    print(args...);
}
template <typename T>
T sum_(vector<T> vec, T init = 0) {
    return std::accumulate(all(vec), T(init));
}

void yn(bool tf) { print(tf ? "Yes" : "No"); }
void YN(bool tf) { print(tf ? "YES" : "NO"); }

template <typename T>
void init(vector<T>& v) {
    rep (i, v.size())
        cin >> v[i];
}

template <typename T, typename U>
void init(vector<T>& v, vector<U>& w) {
    assert(v.size() == w.size());
    rep (i, v.size())
        cin >> v[i] >> w[i];
}

int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }

// -------------------------------------------------------------------
// sort 1 2 3 4
// pqr 1 2 3 must impl >

bool finish(vec now, vec maxi) {
    rep (i, now.size()) {
        if (now[i] != maxi[i]) return false;
    }
    return true;
}

signed main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);

    int N;
    cin >> N;
    int rest = N;

    map<int, int> mp;
    while (true) {
        bool find = false;
        For(i, 2, sqrt(rest)) {
            if (rest % i == 0) {
                mp[i]++;
                rest /= i;
                find = true;
                break;
            }
        }
        if (not find) {
            mp[rest]++;
            break;
        }
    }

    vector<int> maxi;
    vector<int> num;
    for (auto e : mp) {
        num.pb(e.first);
        maxi.pb(e.second);
    }

    int len = maxi.size();
    vector<int> now(len);
    vector<int> candi;
    while (not finish(now, maxi)) {
        int x = 1;
        rep (i, len)
            x *= pow<int>(num[i], now[i]);

        int k = N / x;
        if (x - 1 > k) candi.pb(x - 1);

        int carry = 1;
        rep (i, len) {
            if (carry == 1) now[i]++;
            if (now[i] > maxi[i]) {
                carry = 1;
                now[i] = 0;
            } else {
                carry = 0;
                break;
            }
        }
    }
    if (N - 1 > 1) candi.pb(N - 1);

    print(sum_(candi));

    // maxi ver

    return 0;
}


Measured memory_bytes: 512