UVa 11347

#include <bits/stdc++.h>
// #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <algorithm>
// #include <cmath>
// #include <vector>
// #include <set>
// #include <map>
// #include <queue>
// #include <stack>
// #include <ctime>
// #include <cassert>
// #include <complex>
// #include <string>
// #include <cstring>
// #include <bitset>
using namespace std;

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")

#define ll              long long int
#define vi              vector< int >
#define vll             vector< ll >

#define sc              scanf
#define pf              printf
#define cspf(i)         pf("Case %d:\n", i)
#define spc             pf(" ")
#define line            pf("\n")

#define ff              first
#define ss              second
#define mp              make_pair
#define pb              push_back
#define ppb             pop_back
#define tp(v,j)         get<j>(v)
#define Log(b,x)        (log(x)/log(b))

#define FOR(i,x,y)      for(int i = int(x); i < int(y); i++)
#define ROF(i,x,y)      for(int i = int(x)-1; i >= int(y); i--)
#define clr(arr,x)      memset(arr, x, sizeof arr)
#define vout(v,sz)      for(int w=0;w<sz;w++){if(w) spc; cout<<v[w];}
#define all(v)          v.begin(), v.end()
#define rall(v)         v.rbegin(), v.rend()
#define unq(v)          sort(all(v)),(v).resize(unique(all(v))-v.begin())
#define fastIO          ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)

#define sc1(x)          sc("%d",&x)
#define sc2(x,y)        sc("%d %d", &x, &y)
#define sc3(x,y,z)      sc("%d %d %d", &x, &y, &z)
#define scl1(x)         sc("%lld",&x)
#define scl2(x,y)       sc("%lld %lld", &x, &y)
#define scf1(x)         sc("%lf",&x);
#define scf2(x,y)       sc("%lf %lf", &x, &y)

#define pf1(x)          pf("%d",x)
#define pf2(x,y)        pf("%d %d", x, y)
#define pfl1(x)         pf("%lld\n",x)
#define pfl2(x,y)       pf("%lld %lld", x, y)

#define MOD             (int)(1e9)
#define MaxN            (ll)1e18
#define inf             0x3f3f3f3f
#define PI              acos(-1.0)  // 3.1415926535897932
#define eps             1e-6

#ifdef ERFANUL007
    #define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template < typename Arg1 >
    void __f(const char* name, Arg1&& arg1){
        cout << name << " = " << arg1 << std::endl;
    }
    template < typename Arg1, typename... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args){
        const char* comma = strchr(names, ',');
        cout.write(names, comma - names) << " = " << arg1 <<" | ";
        __f(comma+1, args...);
    }
#else
    #define debug(...)
#endif

template <class T> inline T bigMod(T p,T e,T M){T ret=1; for(;e>0;e>>=1){ if(e&1) ret=(ret*p)%M; p=(p*p)%M;} return (T)ret;}
template <class T> inline T modInverse(T a,T M){return bigMod(a,M-2,M);}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}

int dx[] = { 1,-1, 0, 0};                //graph moves
int dy[] = { 0, 0, 1,-1};               //graph moves

int pfact[1001][170];
vector< int > prime;

void factorization(int m){
    int n = m;
    for(int i=1; prime[i] * prime[i] <= n; i++){
        while(n % prime[i] == 0){
            n /= prime[i];
            pfact[m][i]++;
        }
    }
    if(n > 1){
        for(int i=1; i<prime.size(); i++){
            if(n == prime[i]){
                pfact[m][i]++;
                break;
            }
        }
    }
}

bool isprime[1001];

void sieve(){
    clr(isprime, 1);
    for(int i=4; i<=1000; i+=2) isprime[i] = 0;
    for(int i=3; i*i<=1000; i+=2){
        if(!isprime[i]) continue;
        for(int j= i*i; j<=1000; j+=(i*2)) isprime[j] = 0;
    }
    prime.pb(0);
    prime.pb(2);
    for(int i=3; i<=1000; i+=2){
        if(isprime[i]) prime.pb(i);
    }
    // debug(prime.size());
    // for(auto it : prime) cout << it << '\n';
    for(int i=2; i<=1000; i++) factorization(i);
}

ll dp[1001][21][170];

void dpsolve(int n, int k){
    if(n < 2) return;
    if(dp[n][k][0]) return;

    dp[n][k][0] = 1;
    for(int i=1; i<170; i++){
        dp[n][k][i] = pfact[n][i];
    }
    dpsolve(n-k, k);
    if(n - k < 2) return;

    for(int i=1; i<170; i++){
        dp[n][k][i] += dp[n-k][k][i];
    }
}


int main()
{
    #ifdef ERFANUL007
        clock_t tStart = clock();
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    sieve();

    int t, ca=0; cin >> t;

    while(t--){
        string s; cin >> s;
        int n = 0, k = 0, i = 0;
        for(; i<s.size(); i++){
            if(s[i]=='!') break;
            n = n * 10 + (s[i] - '0');
        }
        for(; i<s.size(); i++) k++;
        dpsolve(n, k);
        ll ans = 1;
        for(int i=1; i<170; i++){
            if((dp[n][k][i]+1) <= MaxN/ans) ans *= (dp[n][k][i]+1);
            else{
                ans = -1;
                break;
            }
        }
        cout << "Case " << ++ca << ": ";
        if(ans == -1) cout << "Infinity\n";
        else cout << ans << '\n';
    }


    #ifdef ERFANUL007
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}