import sys
from operator import itemgetter
from collections import defaultdict, deque
import heapq
import bisect
import math
import itertools

stdin=sys.stdin
sys.setrecursionlimit(10 ** 8)

ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
Yp=lambda:print('Yes')
Np=lambda:print('No')
inf = 1 << 60
inf1 = float('inf')
mod = 10 ** 9 + 7
mod = 998244353
eps = 1e-9
sortkey1 = itemgetter(0)
sortkey2 = lambda x: (x[0], x[1])

###############################################################

N = ip()

def f(x):
    t = math.sqrt(x)
    ok = t - 1; ng = t + 1
    for _ in range(50):
        mid = (ok + ng) / 2
        if mid * mid > x:
            ng = mid
        else:
            ok = mid
    return ok

ans = 0
for _ in range(N):
    x = ip()
    ans += f(x)
    print(ans)