Project Euler & HackerRank problem 3 solution: Largest prime factor - solved using Python

Project-Euler-Problem-3.py

n = int(input('The largest prime factor of '))
while n%2==0: n//= 2  # Remove all even factors
d = 3
while d*d <= n:
    if n % d == 0:
        n//= d
    else:
        d+= 2
print ("is", 2 if n==1 else n)