#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef complex<double> P; typedef pair<int,int> pii; #define REP(i,n) for(ll i=0;i<n;++i) #define REPR(i,n) for(ll i=1;i<n;++i) #define FOR(i,a,b) for(ll i=a;i<b;++i) #define DEBUG(x) cout<<#x<<": "<<x<<endl #define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl #define ALL(a) (a).begin(),(a).end() #define MOD (ll)(1e9+7) #define ADD(a,b) a=((a)+(b))%MOD #define FIX(a) ((a)%MOD+MOD)%MOD ll n; double dp[1010]; bool check(double d){ fill(dp,dp+1010,0); REP(i,n){ REP(j,6){ if(j>i) dp[i+1]+=d; if(i>=j) dp[i+1]+=dp[i-j]; } dp[i+1]=dp[i+1]/6.0+1; } return dp[n]>d; } int main(){ ll t; cin >> t; cout.precision(20); cout.setf(ios::fixed); while(t--){ cin >> n; if(n<100){ double l=0,r=1e9; REP(i,10000){ double m=(l+r)/2.0; if(check(m))l=m; else r=m; } cout << (l+r)/2 << endl; }else{ double res = (double)(n+1)+2.0/3.0; cout << res << endl; } } return 0; }