#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const int INF = 1e9;
const int MOD = 1000000007;

int f(int x){
    return x%2 == 0 ? x/2 : 3*x+1;
}

int main(){
    int n;
    cin >> n;
    int cnt = 0;
    int m = n;
    while(n != 1){
        n = f(n);
        m = max(m,n);
        cnt ++;
    }
    cout << cnt << endl;
    cout << m << endl;
    return 0;
}