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
#include<bits/stdc++.h>

int n,pre,maap[1000000],ans;

int main(){
	scanf("%d",&n);
	pre = n;
	ans = 0;
	while(1){
		ans ++;
		if(maap[pre]!=0) break;
		maap[pre] = 1;
		if(pre&1){
			pre = pre*3+1;
		} else {
			pre /=2;
		}
	}
	printf("%d\n",ans);
	return 0;
}
