import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    for x in range(II()):
        k = II()
        if k>1000:
            print(k+4/3)
            continue
        dp = [0] * (k + 1)
        loop = 100
        l = 0
        r = k + 6
        for _ in range(loop):
            m=(l+r)/2
            dp[0]=m
            for i in range(k - 1, -1, -1):
                dp[i] = sum(dp[i + j] if i + j <= k else dp[0] for j in range(1, 7)) / 6 + 1
            if dp[0]>m:l=m
            else:r=m
        print(m)

main()