#include<cstdio>
#include<cstring>
using namespace std;
const int S=100005;
long double f[S+5][10][2],ans[S+5],x;
int Test,n,T,i,j,k,s,p;
int main()
{
    ans[1]=1;
    for (i=0;i<10;i++)
        f[2][i][0]=f[2][i][1]=1.;
    for (i=2;i<=S;i++)
        for (j=0;j<10;j++)
        {
            ans[i]+=(f[i][j][0]*j+f[i][j][1]*(9-j))/90.;
            for (k=0;k<10;k++)
                if (k<j) f[i+1][k][1]+=(f[i][j][0]+1)*j/9./(9-k)+f[i][j][1]*(9-j)/9./(9-k);
              else if (k>j) f[i+1][k][0]+=f[i][j][0]*j/9./k+(f[i][j][1]+1)*(9-j)/9./k;
      }
  scanf("%d",&Test);
    while (Test--)
    {
        scanf("%d",&n);
        printf("Case #%d:\n",++T);
        printf("%.6f %.6f\n",(double)ans[n],(double)((n+ans[n]-1)*1./ans[n]));
  }
}