#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

using ld=double;
ll mod=1000000007;//一次元ベクトルの高速化dp
vector<ld> matmul(vector<ld> &dp, vector<vector<ld>> &mt){
    ll m=dp.size();
    vector<ld> ret(m,0); 
    rep(i,m)rep(j,m){
      ret[i]+=mt[i][j]*dp[j];
    }
    return ret;
}
vector<vector<ld>> update(vector<vector<ld>> &mt){
    ll m=mt.size();
    vector<vector<ld>> ret(m,vector<ld>(m,0));
    rep(i,m)rep(j,m)rep(k,m){
        ret[i][j]+=mt[i][k]*mt[k][j];
    }
    return ret;
}
void matpow(vector<ld> &dp, vector<vector<ld>> &mt, ll k){
    ll m=dp.size();
    while(k){
        if(k&1)dp=matmul(dp,mt);
        mt=update(mt);
        k/=2;
    }
}

void solve(){
  ll n;cin >> n;
  ld ok=INF,ng=1;
  rep(_,15){
    ld mid=sqrtl(ok*ng);
    vector<ld> dp(7,mid);
    dp[0]=0;dp[6]=1;
    vector<vector<ld>> mat(7,vector<ld>(7));
    rep(i,6)mat[0][i]=(ld)1.0/6;mat[0][6]=1;
    rep(i,5)mat[i+1][i]=1;mat[6][6]=1;
    matpow(dp,mat,n);
    if(dp[0]<=mid)ok=mid;
    else ng=mid;
  }
  cout << ok << endl;
}
int main(){
  ll t;cin >> t;
  CST(20);
  while(t--)solve();
}