#include <iostream>
#include <algorithm>
#include <regex>
using namespace std;

int main(){
    long long n;
    cin >> n;
  	int counter = 0, maxvalue = n;
    while ( n > 1 ) {
        if ( n % 2 == 0 ) n = n / 2;
      	else n = 3*n + 1;
      	if ( maxvalue < n ) maxvalue = n;
      	counter ++;
    }
	cout << counter << endl;  
	cout << maxvalue << endl;  

    return 0;
}