import java.util.List;
import java.util.Scanner;
import java.util.ArrayList;

public class Main {
    static int f(int n) {
        if (n % 2 == 0) {
            return n / 2;
        } else {
            return 3 * n + 1;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int s = sc.nextInt();
        int[] a = new int[1000005];
        ArrayList<Integer> array = new ArrayList<>();
        for (int i = 0; i < 1000005; i++) {
            if (i == 0)
                a[i] = s;
            else {
                a[i] = f(a[i - 1]);
            }
            if (array.contains(a[i])) {
                System.out.println(i + 1);
                return;
            } else
                array.add(a[i]);
        }
    }

}

/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