#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lint;
int main() {
	lint n0;
	cin >> n0;
	if (n0 == 1) {
		cout << 0 << endl << 1 << endl;
	}
	else {
		vector<lint>vec(1000);
		int cnt = 0;
		while (n0 > 1) {
			vec.at(cnt) = n0;
			if (n0 % 2) {
				n0 = 3 * n0 + 1;
			}
			else {
				n0 = n0 / 2;
			}
			cnt++;
		}
		sort(vec.begin(), vec.end());
		cout << cnt << endl << vec.at(999) << endl;
	}



	

}