F = [0]*50
F[1] = 1
for i in range(2, 50) :
F[i] = F[i-1] + F[i-2]
def maxF(k):
left = 0
right = 49
while right - left > 1:
mid = (left+right) // 2
if F[mid] < k:
left = mid
else:
right = mid
return F[left]
Z = int(input())
for i in range(Z):
k = int(input())
print (maxF(k))
RiA9IFswXSo1MApGWzFdID0gMQpmb3IgaSBpbiByYW5nZSgyLCA1MCkgOgoJRltpXSA9IEZbaS0xXSArIEZbaS0yXQogCmRlZiBtYXhGKGspOgoJbGVmdCA9IDAKCXJpZ2h0ID0gNDkKCXdoaWxlIHJpZ2h0IC0gbGVmdCA+IDE6CgkJbWlkID0gKGxlZnQrcmlnaHQpIC8vIDIKCQlpZiBGW21pZF0gPCBrOgoJCQlsZWZ0ID0gbWlkCgkJZWxzZToKCQkJcmlnaHQgPSBtaWQKCXJldHVybiBGW2xlZnRdCiAKWiA9IGludChpbnB1dCgpKQpmb3IgaSBpbiByYW5nZShaKToKCWsgPSBpbnQoaW5wdXQoKSkKCXByaW50IChtYXhGKGspKQo=