diff --git a/math/mod_inverse_by_fermat_theorem.cpp b/math/mod_inverse_by_fermat_theorem.cpp
index 5276956f7..73dd6e656 100644
--- a/math/mod_inverse_by_fermat_theorem.cpp
+++ b/math/mod_inverse_by_fermat_theorem.cpp
@@ -45,12 +45,17 @@ int64_t binExpo(int64_t a, int64_t b) {
 }
 
 int main() {
-    // Take input of  a. (A number for which we want to find modular inverse with m)
+
     int64_t a;
+    /*
+        Take input of  a.
+        (A number for which we want to find modular inverse with m)
+    */
+
     std::cout << "Give input a for computing ((a^(-1))%(m)) : ";
     std::cin >> a;
 
-    std::cout << "The modular inverse of a with mod m is (a^(m-2)) equivalent (a^(-1)) mod m : ";
+    std::cout << "The modular inverse of a with mod m is (a^(m-2)) : ";
     std::cout << binExpo(a, m-2) << std::endl;
 }