A sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:

* The first term s is given as input.

* Let f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.

* a_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.




Find the minimum integer m that satisfies the following condition:

* There exists an integer n such that a_m = a_n (m > n).

Constraints

* 1 \leq s \leq 100
* All values in input are integers.
* It is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.

Input

Input is given from Standard Input in the following format:


s


Output

Print the minimum integer m that satisfies the condition.

Examples

Input

8


Output

5


Input

7


Output

18


Input

54


Output

114
import sys


# get from std-I/O.
def loading_inputs():
    S = raw_input()
    S = int(S)
    return S


def an_func(an):
    if an%2==0: an = an/2
    else :      an = (3*an) + 1
    return an


def check_index(li, x, i, default=-1):
    if x in li: return i + 1
    else:       return default



def main():

    ans = 0
    an  = list()

    a_i = loading_inputs()
    an.append(a_i)
    for i in range(1, 10**6):

        a_i = an_func(a_i)
        ans = check_index(an, a_i, i)
        if(ans!=-1):
            break
        else:
            an.append(a_i)

    print ans



if __name__ == "__main__":
    main()