/*
  reffered to http://yukicoder.me/submissions/3478
 */
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
#define MAX_N 1000010
double ans[MAX_N];
double e[] ={0,
             1.0000000000000000,
             1.0833333333333333,
             1.2569444444444444,
             1.5353009259259260,
             1.6915991512345676,
             2.0513639724794235};
double p[10];

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  p[6] = 1;
  for(int i = 2; i <= 6;i++){
    double t = 1;
    for (int j = 1; j < i-1;j++){
      t += p[j] * e[i-j]; // i-j + j -> i
    }
    p[i-1] = e[i] - t;
    p[6]-=p[i-1];
    //DEBUG1(p[i-1]);
  }

  ans[0] = 0;
  for(int i = 1;i < MAX_N;i++){
    ans[i] = 1;
    for(int k = 1; k <= 6;k++){
      if(i-k>=0){
        ans[i] += ans[i-k] * p[k];
      }
    }
  }
  
  int T;
  cin >> T;
  while(T--){
    int N;
    cin >> N;
    cout << fixed << setprecision(10) << ans[N]<<endl;
  }

  return 0;
}