#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int f(int n) {
	if(n == 0) return 0;
	int i = 0;
	while((1LL << (i+1)) <= n) ++ i;
	return i + 1;
}

int main() {
	const ll X = 4294967295LL;
	vector<ll> v;
	for(ll d = 1; (ll)d * d <= X; ++ d) if(X % d == 0) {
		v.push_back(d);
		if(d * d != X)
			v.push_back(X / d);
	}
	int A;
	while(cin >> A) {
		int ans = -2;
		each(i, v) {
//			cerr << *i << ", " << A / *i << ", " << f(A / *i) << endl;
			ans += f(A / *i);
		}
		cout << ans << endl;
	}
	return 0;
}