#include<bits/stdc++.h>
using namespace std;
#define debug cout<<"YES\n";
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+5;
const int lz=0;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}
double a[maxn];
int main(){/*
freopen("d://in.txt","r",stdin);
freopen("d://out.txt","w",stdout);*/
a[1]=1;
rep(i,2,maxn) a[i]=1.0*a[i-1]*(2*i-3)/(2*i-2);
///printf("%.5f\n",b[2]);
int t;scanf("%d",&t);
while(t--){
int n;
scanf("%d",&n);n>>=1;
printf("%.4f\n",1-a[n]);
}
return 0;
}