import math

class FenwickTree:
    def __init__(self, n):
        self.n = n + 1
        self.v = [0] * n
    
    def __init__(self, a):
        self.n = len(a) + 1
        self.v = [0] + a
        pow2 = 1
        while 2 * pow2 < self.n:
            i = 2 * pow2
            while i < self.n:
                self.v[i] += self.v[i - pow2]
                i += 2 * pow2
            pow2 *= 2

    # 区間 [0..r) の和を返す
    def sum(self, r):
        res = 0
        while r > 0:
            res += self.v[r]
            r -= r & -r
        return res

    # 位置 i に x を加算する
    def add(self, i, x):
        i += 1
        while i <= self.n:
            self.v[i] += x
            i += i & -i

n = int(input())

x = []
for i in range(n):
    x.append(math.sqrt(int(input())))

f = FenwickTree(x)

for i in range(n):
    res = f.sum(i + 1)
    print(f'{res:.18g}')