[24일차][프로그래머스][12943]콜라츠 추측

def solution(num):
    n = num
    count = 0

    while n > 1:	
        if n == 1:
            break
            
        if count == 500:
            count = -1
            break
            
        if n % 2 == 0:
            count += 1
            n = int(n / 2)		
        else:    		
            n = (n * 3) + 1
            count += 1

    return count