#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
int tot=0;
void solved(){
     int n;
     printf("Case #%d:\n",++tot);
     scanf("%d",&n);
     double len=0;
     for(int i=0;i<9;i++)len+=0.1*(9-i)/9*(9-i)/9*(n-2);
     len*=2;
     len+=1;
     double t=(n+len-1)/len;
     printf("%.6lf %.6lf\n",len,t);
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--)solved();
    return 0;
}