def fibNum(n):
f = [0] * n
f[0] = 0
f[1] = 1
for x in range(2, n):
f[x] = f[x-1]+f[x-2]
return (f[n-1])
# Program to display the Fibonacci sequence forever
def fibonacci(i,j):
print(i;fibonacci(j,i+j))
fibonacci(1,1)