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
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;

#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define klar(v) memset(v, 0, sizeof(v))
#define bust ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define gcd(a, b) __gcd(a, b);
#define debug(x) cout << #x << " " << x << endl;
#define endl "\n"

typedef vector<int> vi;
typedef vector<pair<int, int> > vpii;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long long ll;
const int maxn = 5e5+100;

int dd(int a, int l){
    if(l-a > a)return 1;
    return 0;
}

int dod(int l, int d){
    l /= d;
    int ret = 0;
    for(int i = 2; i*i <= l; i++){
        if(l%i == 0){
            if(i*i != l)ret += dd(l/i, l);
            ret += dd(i, l);
        }
    }
    return ret;
}

int main(){
    bust
    int n;
    cin >> n;
    ll ans = 0;
    for(int i = 1; i*i <= n; i++){
        if(n%i == 0){
            ans += dod(n-i, i);
            if(i*i != n)ans += dod(n-n/i, (n/i));
        }
    }
    cout << ans << endl;
}