// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define TEST cerr << "TEST" << endl
#define AMARI 998244353
// #define AMARI 1000000007
#define TIME_LIMIT 1980000
#define el '\n'
#define El '\n'

#define MULTI_TEST_CASE false
void solve(void) {
    int n;
    cin >> n;
    if(n == 0){
        cout << "No" << el;
        return;
    }
    int cnt = 0;
    while(1){
        int np = n;
        cnt++;
        if(n == 1){
            cnt++;
            break;
        }
        if(n % 2 == 0)n /= 2;
        else n = 3 * n + 1;
        cnt++;
        if(cnt > 50)break;
    }
    if(cnt >= 50){
        cout << "No" << el;
        return;
    }
    cout << "Yes" << el;
    cout << cnt << El;
    return;
}

void calc(void) {
    return;
}

signed main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE) cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}