diff --git a/2006/toledo1/README.md b/2006/toledo1/README.md
index c3bc3ced6..931e35290 100644
--- a/2006/toledo1/README.md
+++ b/2006/toledo1/README.md
@@ -1,10 +1,7 @@
 # Best Small Program
 
-    Oscar Toledo
-    Av. Santa Cruz del Monte 9-304
-    Ciudad Satelite. Edo. de Mexico
-    CP. 53110
-    Mexico
+Oscar Toledo
+Mexico
 
 ## To build:
 
@@ -15,9 +12,12 @@ make
 ## To run:
 
 ```sh
-./toledo1 twodigits
+./toledo1 [0-9][0-9]
 ```
 
+where `[0-9][0-9]` is a two digit number.
+
+
 ## Try:
 
 ```sh
@@ -42,14 +42,16 @@ to visit the 64 squares without repeating them?
 If not, this program does it, just run it with an argument
 giving initial position.
 
-        ./toledo1 11         (start is A8)
-        ./toledo1 18         (start is H8)
-        ./toledo1 81         (start is A1)
-        ./toledo1 88         (start is H1)
-        ./toledo1 44         (start is D5)
+```sh
+./toledo1 11       # start is A8
+./toledo1 18       # start is H8
+./toledo1 81       # start is A1
+./toledo1 88       # start is H1
+./toledo1 44       # start is D5
+```
 
 It will print move order. The algorithm is so simple that you can read
-it on the source code, at the first glance it can appear checkered :-)
+it in the source code, at the first glance it can appear checkered :-)
 but don't dismail, jar, jar.
 
 ## Copyright and CC BY-SA 4.0 License: