fl.cpp

#include<cstdio>
#include<cstdlib>
#include<cstring>
 
#include<cmath>
#include<cctype>
#include<climits>
#include<algorithm>
#include<utility>
#include<string>
 
#include<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
 
 
using namespace std;
 
#define REP(i,N) for (int i = 0; i < (N); i++)
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORI(i,a,b) for (int i = (a); i < (b); i++)
#define FORD(i,a,b) for (int i = (a)-1; i >= (b); i--)
#define DP(arg...) fprintf(stderr, ## arg)
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
 
long long n;
 
void solve() {
	int ans = 0;
	FOR(x, n+1, 2*n) {
		if ((n*x)%(x-n)==0) {
			long long y = (n*x)/(x-n);
			if (y>0) ans++;
		}
	}
	printf("%d\n", ans);
}
 
int main() {
	int a;
	while (scanf("%d/%lld", &a, &n) != EOF) {
		solve();
	}
	return 0;
}