Function func

CodeChef_problems/FIBEASY/solution.py:16–21

(n)

    x=y%10
    y=z%10
def func(n):
    power=0
    while(n>0):
        n=n>>1
        power+=1
    return 2**(power-1)
for tc in range(t): #fibonacci series last digits repeat after every 60 values hence we have used mod 60
    n=int(input())