def solve(testcase):
n = II()
m = int(sqrt(n))
while (m + 1) * (m + 1) <= n:
m += 1
while m * m > n:
m -= 1
print(m)
for testcase in range(II()):
solve(testcase)

def solve(testcase):
n = II()
m = int(sqrt(n))
while (m + 1) * (m + 1) <= n:
m += 1
while m * m > n:
m -= 1
print(m)
for testcase in range(II()):
solve(testcase)