Trailing Zeroes (III)

You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For example, 5! = 120, 120 contains one zero on the trail.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case contains an integer Q (1 ≤ Q ≤ 108) in a line.

Output

For each case, print the case number and N. If no solution is found then print 'impossible'.

Sample Input

3

1

2

5

Sample Output

Case 1: 5

Case 2: 10

Case 3: impossible

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
ll Trailing_Zeroes(ll n)
{
	ll ans=0;
	while(n)
	{
		ans+=n/5;
        n/=5;
	}
	return ans;
}
int main()
{
	int t,k=1;
	scanf("%d",&t);
	while(t--)
	{
		ll q;
		cin>>q;
		ll ans=0,left=1,right=1000000000000;
		while(left<=right)
		{
			ll mid=(left+right)/2;
			if(Trailing_Zeroes(mid)==q)
			{
				ans=mid;
				right=mid-1;
			}
			else if(Trailing_Zeroes(mid)>q)
			{
				right=mid-1;
			}
			else
				left=mid+1;
		}
		printf("Case %d: ",k++);
		if(ans)
            printf("%lld\n",ans);
        else
            printf("impossible\n");
	}
	return 0;
}