import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) B solver = new B(); solver new B() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        }

    } B public void solve(int testNumber, Scanner in, PrintWriter out) {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        } solve {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        } int s = in.nextInt(); s in.nextInt() in.nextInt in boolean[] exists = new boolean[1000001]; exists new boolean[1000001] 1000001 int index = 0; index 0 while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            } true {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            } index++ index if (exists[s]) {
                    out.println(index);
                    return;
                } exists[s] exists s {
                    out.println(index);
                    return;
                } out.println(index) out.println out index return; exists[s] = true exists[s] exists s true if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                } s % 2 == 0 s % 2 s 2 0 {
                    s = s / 2;
                } s = s / 2 s s / 2 s 2 {
                    s = 3 * s + 1;
                } s = 3 * s + 1 s 3 * s + 1 3 * s 3 s 1 int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int s = in.nextInt();
            boolean[] exists = new boolean[1000001];

            int index = 0;
            while (true) {
                index++;
                if (exists[s]) {
                    out.println(index);
                    return;
                }
                exists[s] = true;
                if (s % 2 == 0) {
                    s = s / 2;
                } else {
                    s = 3 * s + 1;
                }
            }
        }

    }
}

