diff --git a/Daily/Minimum_number.cpp b/Daily/Minimum_number.cpp
index 2afdc21..d2be804 100644
--- a/Daily/Minimum_number.cpp
+++ b/Daily/Minimum_number.cpp
@@ -3,7 +3,6 @@ You are given an array arr of n elements. In one operation you can pick two indi
  replace the value of arr[i] with (arr[i] - arr[j]). You have to minimize the values of the array after performing any number
  of such operations.
 
-
 Example 1:
 Input:
 n = 3