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
#include <bits/stdc++.h>

using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;

#define IOSWORK ios::sync_with_stdio(0); cin.tie(0)
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define VAR(v, n) typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000007

#define MAXSIZE 1000000000

set<int> dziel;
LL wyn=0;

LL komb(int n){
	
	if(n<=5)
		return 0;
	
	LL ile=0;
	
	for(int i=1;i*i<=n;i++){
		if(n%i==0){
			if(i<n/2&&i!=1)
				ile++;
			if(n/i!=i&&n/i<n/2)
				ile++;			
		}
	}
	
	return ile;
}

int main(){ //o(sqrt(n)*sqrt(n))
	IOSWORK;
   
	int n;
	cin>>n;
	
	for(int i=1;i*i<=n;i++){
		if(n%i==0){
			wyn+=komb(n/i-1);
			if(n/i!=i)
				wyn+=komb(i-1);
		}
	}
	
	cout<<wyn;
	return 0;
}