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

long long int n0;
long long int maxi=-1;

int search1(long long int x){
    maxi=max(maxi,x);
    if(x==1){
        return 0;
    }
    if(x%2==0){
        return search1(x/2)+1;
    }
    else{
        return search1(3*x+1)+1;
    }
}

void solve(){
    cin>>n0;
    cout<<search1(n0)<<endl;;
    cout<<maxi<<endl;
}

int main(){
    solve();
    return 0;
}