/*** author: yuji9511 ***/ #include using namespace std; typedef long long ll; typedef pair lpair; const ll MOD = 1e9 + 7; const ll INF = 1e18; #define rep(i,m,n) for(ll i = (m); i < (n); i++) #define rrep(i,m,n) for(ll i = (m); i >= (n); i--) #define print(x) cout << (x) << endl; #define print2(x,y) cout << (x) << " " << (y) << endl; #define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " \n"[i==n-1];}; int main(){ cin.tie(0); ios::sync_with_stdio(false); ll N; cin >> N; ll ans = N; ll idx = 0; while(N != 1){ if(N % 2 == 0){ N /= 2; }else{ N = 3*N+1; } ans = max(ans, N); idx++; } print(idx); print(ans); }