import java.util.*;
 
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int s = sc.nextInt();
		int prevA = s;
 
		Set<Integer> prevFValues = new HashSet<>();
		prevFValues.add(s);
		for (int i=2; i<=1000000; i++) {
			int newA = f(prevA);
			if (prevFValues.contains(newA)) {
				System.out.println(i);
				return;
            }
			prevFValues.add(newA);
			prevA = newA;
		}
	}

	static int f(int n) {
		return (n % 2 == 0) ? (n / 2) : (3 * n + 1);
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz