#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

LL f(LL x)

{

    if (x&)

    {

        return (x+)/*x;

    }

    else return x/*(x+);

}

int ff;

void work ()

{

    LL n;

    cin>>n;

    LL begin=,end=2e9;

    while (begin<=end)

    {

        LL mid = (begin + end) / ;

        if (f(mid) == n)

        {

            printf ("Case #%d: %lld\n",++ff,n);

            return ;

        }

        if (f(mid) < n)

        {

            begin = mid+; //去找一个可能比n大的

        }

        else end = mid-; //如果比n大了的话。就回来找一个小的。

        //cout<<f(mid)<<endl;

    }

    printf ("Case #%d: %lld\n",++ff,f(end));

    return ;

}

int main()

{

#ifdef local

    freopen("data.txt","r",stdin);

#endif

    int t;

    cin>>t;

    while(t--) work();

    return ;

}