Project Euler #14

euler14.py

def hotpo(n):
    steps = 0
    while n > 1:
        if n % 2 == 0:
            n = n / 2
        else:
            n = 3 * n + 1
        steps += 1
    return steps

print max((hotpo(i), i) for i in range(1, 1000000))[1]