diff --git a/Project Euler/Problem 03/sol1.py b/Project Euler/Problem 03/sol1.py
index bd3e237e7..23ab8746a 100644
--- a/Project Euler/Problem 03/sol1.py	
+++ b/Project Euler/Problem 03/sol1.py	
@@ -17,7 +17,7 @@ def isprime(no):
             return False
     return True
 
-max=0
+maxNumber = 0
 n=int(input())
 if(isprime(n)):
     print n
@@ -31,8 +31,8 @@ else:
         for i in range(3,n1,2):
             if(n%i==0):
                 if(isprime(n/i)):
-                    max=n/i
+                    maxNumber = n/i
                     break
                 elif(isprime(i)):
-                    max=i
-        print max
+                    maxNumber = i
+        print maxNumber