diff --git a/dynamic_programming/brige_torch_problem.py b/dynamic_programming/brige_torch_problem.py
index ac5ba42f0..8e9cf2082 100644
--- a/dynamic_programming/brige_torch_problem.py
+++ b/dynamic_programming/brige_torch_problem.py
@@ -1,4 +1,4 @@
-#person_pace = [1, 2, 5, 10,12,16]
+# person_pace = [1, 2, 5, 10,12,16]
 person_pace = list(map(int, input().split()))
 person_pace.sort()  # Sort the array for optimal pairing
 people = len(person_pace)