Lukujono

def trav(x):
    if x == 1: return 1
    if x % 3 == 0: return x // 3
    return x * 2 + 1


def steps(x):
    if x == 1: return (1, True)
    vis = set()
    taken = 1
    fn = False

    while (x not in vis):
        vis.add(x)
        if x == 1:
            fn = True
            break

        newk = trav(x)
        x = newk
        taken += 1
        if x > 10**40:
            return (taken, False)

    return (taken, fn)


t = int(input())

for i in range(t):
    n = int(input())
    s = steps(n)
    print([-1, s[0]][s[1]])

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED