zinating
diff --git a/‎dynamic_programming/fibonacci.py‎
Lines changed: 12 additions & 9 deletions b/‎dynamic_programming/fibonacci.py‎
Lines changed: 12 additions & 9 deletions
@@ -1,16 +1,18 @@
 """
 This is a pure Python implementation of Dynamic Programming solution to the fibonacci sequence problem.
 """
-class Fibonacci:
 
+
+class Fibonacci:
     def __init__(self, N=None):
         if N:
+            N = int(N)
             self.fib_array = [0] * (N + 1)
             self.fib_array[0] = 0
             self.fib_array[1] = 1
             for i in range(2, N + 1):
                 self.fib_array[i] = self.fib_array[
-                    i - 1] + self.fib_array[i - 2]
+                                        i - 1] + self.fib_array[i - 2]
         else:
             self.fib_array = [None] * (N + 1)
 
@@ -43,12 +45,13 @@ def get(self, sequence_no=None):
             "\n********* Enter different values to get the corresponding fibonacci sequence, enter any negative number to exit. ************\n")
         while True:
             print("Enter value: ", end=" ")
-            i = eval(input())
-            if i < 0:
-                print("\n********* Good Bye!! ************\n")
-                break
-            fib.get(i)
-    except NameError:
-        print("\nInvalid input, please try again.")
+            try:
+                i = eval(input())
+                if i < 0:
+                    print("\n********* Good Bye!! ************\n")
+                    break
+                fib.get(i)
+            except NameError:
+                print("\nInvalid input, please try again.")
     except NameError:
         print("\n********* Invalid input, good bye!! ************\n")