#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <cstring>
#include <functional>
#include <climits>
#include <list>
#include <ctime>
#include <complex>
 
#define F1(x,y,z) for(int x=y;x<z;x++)
#define F2(x,y,z) for(int x=y;x<=z;x++)
#define F3(x,y,z) for(int x=y;x>z;x--)
#define F4(x,y,z) for(int x=y;x>=z;x--)
#define pb push_back
#define LL long long
#define co complex<double>
 
#define MAX 100005
#define AMAX 1500
#define MOD 1000000007

#define f(c,d) ((1<<(c))*(d))

using namespace std;

LL n,ta,tb;
set<LL> x;

int main(){
    while(scanf("%I64d",&n)==1){
        ta=tb=0;
        while(n+1>(1LL<<(ta+1)))ta++;
        while(n+1>=(1LL<<(tb+1)))tb++;
        ta++;
        if(ta==tb)printf("%I64d\n",ta);
        else{
            x.clear();
            x.insert(1);
            F4(a,tb,1){
                x.insert(n);
                n--;
                ta=(1LL<<a)-1+(1LL<<(a-1))-1;
                if(n<=ta){
                    F1(b,1,a)x.insert((1LL<<b)-1);
                    n-=(1LL<<(a-1))-1;
                }else{
                    F2(b,1,a)x.insert((1LL<<b)-1);
                    n-=(1LL<<a)-1;
                }
            }
            // X 0
            printf("%d\n",x.size());
        }
    }
    //system("pause");
    return 0;
}