A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers.

Now given a humble number, please write a program to calculate the number of divisors about this humble number.For examle, 4 is a humble,and it have 3 divisors(1,2,4);12 have 6 divisors.

The input consists of multiple test cases. Each test case consists of one humble number n,and n is in the range of 64-bits signed integer. Input is terminated by a value of zero for n.

For each test case, output its divisor number, one line per case.

4
12
0

3
6

lcy

#include <stdio.h>
typedef long long ll ;

ll div(ll n, int fac)
{
	ll ans = 0 ;
	while(n%fac==0)
	{
		++ans ;
		n /= fac ;
	}
	return ans ;
}

int main()
{
	ll n ;
	while(~scanf("%I64d",&n) && n)
	{
		ll ans = 1;
		ans *= div(n,2)+1;
		ans *= div(n,3)+1;
		ans *= div(n,5)+1;
		ans *= div(n,7)+1;
		printf("%I64d\n",ans) ;
	}
	return 0 ;
}