import java.util.HashSet;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        long s = scanner.nextLong();

        HashSet<Long> observed = new HashSet<>();
        observed.add(s);

        long prev = s;

        for(int i=2; i<1000000; i++){

            long candidate;
            if(prev%2 == 0){
                candidate = prev / 2;
            }else{
                candidate = 3 * prev + 1;
            }

            if(observed.contains(candidate)){
                System.out.println(i);
                return;
            }else{
                observed.add(candidate);
                prev = candidate;
            }
        }

    }
}
/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