#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
template<class T, class Compare = less<T> >
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template<class T, class Compare = greater<T> >
using MinHeap = priority_queue<T, vector<T>, Compare>;
using llong = long long;


int main() {
    int n;
    int i1 = 0;
    int nmax = 1;

    cin >> n;

    while (n != 1) {
        nmax = max(n, nmax);
        i1++;

        if (n & 1) n = 3 * n + 1;
        else n = n / 2;
    }

    cout << i1 << endl;
    cout << nmax << endl;
    
    return 0;
}