#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  ll cnt = 0;
  set<ll> ok;
  ll mx = n;
  bool f = true;
  ok.insert(n);
  if(n==1){
    cnt = 0;
    f = false;
  }

  while(n!=1){
    if(n%2==0) n/=2;
    else n = 3*n+1;
    mx = max(mx, n);
    if(ok.find(n)!=ok.end()) break;
    ok.insert(n);
    if(f) cnt++;
    if(n==1&&f) break;
  }
  std::cout << cnt << '\n';
  std::cout << mx << '\n';
  return 0;
}