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
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <bits/stdc++.h>

using namespace std;

#define PB push_back
#define FORE(i, t) for(__typeof(t.begin())i=t.begin();i!=t.end();++i)
#define SZ(x) int((x).size())
#define REP(i, n) for(int i=0,_=(n);i<_;++i)
#define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i)
#define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;

int h(int n) {
    if (n >= 2) {
        return 1;
    }
    return 0;
}

int g(int n) {
    if (n <= 1) {
        return 0;
    }
    int result = 0;
    for (int d = 2; d * d <= n; ++d) {
        if (n % d != 0) {
            continue;
        }
        int nd = n / d;
        result += h(d - 1);
        if (d != nd) {
            result += h(nd - 1);
        }
    }
    return result;
}

int f(int n) {
    if (n <= 1) {
        return 0;
    }
    int result = 0;
    for (int d = 1; d * d <= n; ++d) {
        if (n % d != 0) {
            continue;
        }
        int nd = n / d;
        result += g(d - 1);
        if (d != nd) {
            result += g(nd - 1);
        }
    }
    return result;
}

void inline one() {
    int n;
    cin >> n;
    int result = f(n);
    cout << result << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    //int z; cin >> z; while(z--)
    one();
}