递归函数
//package lxk;
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static int work(int n, int res) {
if(n == 1) return res;
if(n%2 == 0) {
return work(n/2, res+1);
}
else {
return work((3*n+1)/2, res+1);
}
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int ans = work(n, 0);
System.out.println(ans);
}
}