Update sol1.py

Author: MaximSmolskiy

project_euler/problem_095/sol1.py

@@ -17,7 +17,8 @@
 
 Since this chain returns to its starting point, it is called an amicable chain.
 
-Find the smallest member of the longest amicable chain with no element exceeding one million.
+Find the smallest member of the longest amicable chain with
+no element exceeding one million.
 
 Solution is doing the following:
 - Get relevant prime numbers