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 java.util.HashSet;
import java.util.Scanner;

public class Main{

	public static void main(String args[]) {
		Scanner scan = new Scanner(System.in);
		int s = scan.nextInt();
		
		HashSet<Integer> hs = new HashSet<>();
		int a1 = s;
		hs.add(s);
		int m = 1;
		boolean found = false;
		
		while(found == false) {
			if((a1 % 2 == 0)) {
				a1 = a1 / 2;
			}else {
				a1 = 3 * a1 + 1;
			}
			
			m++;
			
			if(hs.contains(a1)) {
				System.out.println(m);
				found = true;
			}
			
			hs.add(a1);
		}
		
	}
	
}