E - 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<bits/stdc++.h>
using namespace std;
long long getSum(long long n){
    long long ans=0;
    while(n){
        ans+=n/5;
        n/=5;
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    int k=1;
    while(t--){
        long long n;
        scanf("%lld",&n);
        long long le=1;
        long long re=1000000000;
        while(le<re){
            int mid=(re+le)/2;
            if(getSum(mid)>=n){
                re=mid;
            }else{
                le=mid+1;
            }
        }
        if(getSum(re)!=n)printf("Case %d: impossible\n",k++);
        else printf("Case %d: %d\n",k++,re);
    }
    return 0;
}