diff --git a/chapter07.tex b/chapter07.tex
index b21943c..257542d 100644
--- a/chapter07.tex
+++ b/chapter07.tex
@@ -51,7 +51,7 @@ when the coins are the euro coins,
 but in the general case the greedy algorithm
 does not necessarily produce an optimal solution.
 
-Now it is time to solve the problem efficiently
+Now is time to solve the problem efficiently
 using dynamic programming, so that the algorithm
 works for any coin set.
 The dynamic programming