bai 14 pee
def f(n):
    a=[n]
    if n == 1:
        return []
    while n > 1:
        if n%2 == 0:
            n = n/2
            a.append(n)
        else:
            n= 3*n + 1
            a.append(n)
    return a
i = 2
max = len(f(i))
while i < 1000000:
    if max < len(f(i)):
        max = len(f(i))
        c=i
    i = i+1
print max ,c