1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream> 
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <cassert>
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define DBG cerr << "debug here" << endl;
#define DBGV(vari) cerr << #vari<< " = "<< (vari) <<endl;

#define assert_range(x,a,b) assert((a) <= (x) and (x) <= (b))
using ll = long long;
const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    if (n < 6) {
        cout << 0 << endl;
        return 0;
    }
    ll res = 0;
    vector<int> divisors;
    for (ll d = 1; d*d <= n; ++d) {
        if (n % d == 0) {
            divisors.push_back(d);
            if (d != n/d) {
                divisors.push_back(n/d);
            }
        }
    }

    for (auto a : divisors) {
        int m = n/a-1;
        for (ll k = 2; k*k <= m; ++k) {
            if (m % k == 0) {
                if (k >= 3) {
                    ++res;
                }
                if (k != m/k and m/k >= 3) {
                    ++res;
                }
            }
        }
    }
    cout << res << endl;
    return 0;
}