Basic exercises of test questions Fibonacci series

This method is easy to burst the memory

f =[1]*1000000

n = int(input())

for i in range(3,n+1):
    f[i]=(f[i-1]+f[i-2])%10007
print(f[n])

This is better ：

f1 = 1
f2 = 1

n = int(input())

for i in range(n-2):
    f = (f1+f2)%10007
    f1 = f2
    f2 = f
    
print(f2)