import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int s = sc.nextInt();

		int cnt =0;
		Map<Integer,Integer> map = new HashMap<>();

		int n = s;
		map.put(0, s);
		for (int i = 1; i < 1000000; i++) {

			if (n%2 == 0) {
				n = n/2;
				if (map.containsValue(n)){
					cnt = map.size()+1;
					break;
				}
				map.put(i, n);
			} else {
				n = 3*n +1;
				if (map.containsValue(n)){
					cnt = map.size()+1;
					break;
				}
				map.put(i, n);
			}
		}

		System.out.println(cnt);

	}

}

/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