#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repe(i, n) for(i = 0; i <= (n); i++)
typedef long long ll;

int main()
{
    vector<int> n(400);
    cin >> n[0];
    int i = 1;
    while(1){
        if(n[i - 1] == 1)break;
        if(n[i-1] % 2 == 0)n[i] = n[i - 1] / 2;
        else n[i] = n[i-1] * 3 + 1;
        i++;
    }
    decltype(n)::iterator max = max_element(n.begin(), n.end());
    cout << i - 1<< endl << *max << endl;
    return 0;
}