diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000000000000000000000000000000000000..5b6a0652566d10360493952aec6d4a4febc77083
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,4 @@
+.Rproj.user
+.Rhistory
+.RData
+.Ruserdata
diff --git a/README.md b/README.md
index 29a1d6c030d82bb007b43bef51a192b187f6cde0..fec3afee830ba46c40c0228683866633329cbfdd 100644
--- a/README.md
+++ b/README.md
@@ -1,29 +1,20 @@
-<table>
-  <tr>
-    <!-- Image Column -->
-    <td>
-      <img src="00_data/RJ_santa.jpeg" alt="Image Description"/>
-    </td>
 
-    <!-- Text Column -->
-    <td>
-    
-    # Traveling Santa Problem
-    
-    ## Overview
-    In this challenge, you are provided with a list of cities and their coordinates in `cities.csv`. Your task is to create the shortest possible path that visits all the cities. 
-    
-    ## Submission File
-    Your submission should be an ordered list of cities, representing the path in which you visit each city.
-    
-    ## Path Constraints
-    - Paths must start and end at the North Pole (`CityId = 0`).
-    - You must visit every city exactly once.
-    - The distance between two cities is calculated as the 2D Euclidean distance.
-    - Every 10th step (`stepNumber % 10 == 0`) is 10% longer, except when the step is coming from a city with a prime `CityId`.
+![alt text](00_data/RJ_santa.jpeg "The AIDAHO Santa has lost his way!")
+
     
-    ## Good Luck!
-    Ensure your solution adheres to the constraints and optimizes the travel path. Happy coding!
-   </td>
-  </tr>
-</table>   
\ No newline at end of file
+# Traveling Santa Problem
+
+## Overview
+In this challenge, you are provided with a list of cities and their coordinates in `cities.csv`. Your task is to create the shortest possible path that visits all the cities. 
+
+## Submission File
+Your submission should be an ordered list of cities, representing the path in which you visit each city.
+
+## Path Constraints
+- Paths must start and end at the North Pole (`CityId = 0`).
+- You must visit every city exactly once.
+- The distance between two cities is calculated as the 2D Euclidean distance.
+- Every 10th step (`stepNumber % 10 == 0`) is 10% longer, except when the step is coming from a city with a prime `CityId`.
+
+## Good Luck!
+Ensure your solution adheres to the constraints and optimizes the travel path. Happy coding!
\ No newline at end of file