#include <bits/stdc++.h>
using namespace std;

int main(){
    long long N;
    cin >> N;
    vector<long long> A;
    set<long long> S;
    while(!S.count(N)){
        A.push_back(N);
        S.insert(N);
        if(N % 2 == 0)N /= 2;
        else N = 3 * N + 1;
    }
    
    long long n = A.size();
    long long M = -1;
    long long one;
    for(int i = 0; i < n; i++){
        M = max(M, A[i]);
        if(A[i] == 1){
            one = i;
            break;
        }
    }
    
    cout << one << endl << M << endl;
    return 0;
}