diff --git a/source/Control_Flow_Statements.rst b/source/Control_Flow_Statements.rst
index 3a04541e759cfa1d68b4c19be589a8049b7ed2c5..8deea69c93b2caaa337ad8e1fcb9cb85ef84d196 100644
--- a/source/Control_Flow_Statements.rst
+++ b/source/Control_Flow_Statements.rst
@@ -121,7 +121,7 @@ Exercise
 
 .. literalinclude:: _static/code/restriction.py
    :linenos:
-   :lines: 15-31
+   :lines: 18-33
    :language: python
 
 **pseudocode of second algorithm**
@@ -138,7 +138,7 @@ Exercise
 
 .. literalinclude:: _static/code/restriction.py
    :linenos:
-   :lines: 32-53
+   :lines: 34-55
    :language: python
    
    
@@ -172,7 +172,7 @@ in bonus we can try to sort the list in the order of the position of the binding
 
 .. literalinclude:: _static/code/restriction.py
    :linenos:
-   :lines: 54-
+   :lines: 55-
    :language: python
    
 ::
diff --git a/source/_static/code/fibonacci_iteration.py b/source/_static/code/fibonacci_iteration.py
index 340ba6c5bcdc908c1cb763df365a4ebd4639cb6e..703ee8668a82e0bff1ac06f5dedca3b9171aa4e7 100644
--- a/source/_static/code/fibonacci_iteration.py
+++ b/source/_static/code/fibonacci_iteration.py
@@ -19,12 +19,12 @@ def fibonacci(n):
         elif i == 1:
             fib_suite.append(1)
         else: 
-            res = fib_suite[i-1] + fib_suite[i-2] 
+            res = fib_suite[-1] + fib_suite[-2]
             fib_suite.append(res)
         i += 1
     return fib_suite
 
-print ', '.join([str(i) for i in fibonacci(10)])
+print(', '.join([str(i) for i in fibonacci(10)]))
 
 
 def fibonacci_2(n):