diff --git a/Project Euler/Problem 01/sol3.py b/Project Euler/Problem 01/sol3.py
index 0caa30a53..5448cb897 100644
--- a/Project Euler/Problem 01/sol3.py	
+++ b/Project Euler/Problem 01/sol3.py	
@@ -8,8 +8,8 @@ Find the sum of all the multiples of 3 or 5 below N.
 This solution is based on the pattern that the successive numbers in the series follow: 0+3,+2,+1,+3,+1,+2,+3.
 '''
 n = int(raw_input().strip())
-sum=0;
-num=0;
+sum=0
+num=0
 while(1):
     num+=3
     if(num>=n):
@@ -39,4 +39,4 @@ while(1):
     if(num>=n):
         break
     sum+=num
-print sum;
\ No newline at end of file
+print sum