fl.cpp

#include <bits/stdc++.h>
using namespace std;
 
int gcd(int a, int b) {
	if(a > b) swap(a,b);
	if(a == 0) return b;
	return gcd(b%a,a);}
 
int main() {
	int N;
	while(scanf(" 1/%d",&N) == 1) {
		set< pair<int,int> > S;
		for(int i =1; i <= N; i++) {
			int y =i+N;
			if((y*N)%i != 0) continue;
			int x =y*N/i;
			if(x > y) swap(x,y);	
			S.insert(make_pair(x,y));}
		printf("%d\n",S.size());}
	return 0;}