python question:

the Fibonacci numbers are defined by the sequence f1=1, f2=1, fn=fn-1+ fn-2. Reformulate that as fold1=1; fold2=1; fnew=fold1+fold2; after that, discard fold2, which no longer needed, and set fold2 to fold1 and fold1to fnew. Repeat an appropriate number of times. implement a program that prompts the user for an integer n and prints the nth Fibonacci number, using the above algorithm.