#include<cstdio>

#include<cstring>

#include<algorithm>

#include<iostream>

using namespace std;

const int N = ;

int top;

long long n;

long long f[N], dp[N][], st[N];

int main()

{

    cin >> n;

    f[] = ;

    f[] = ;

    for(int i = ; i <= ; ++i) f[i] = f[i - ] + f[i - ];

    for(int i = ; i; --i) if(n - f[i] >= )

    {

        n -= f[i];

        st[++top] = i;

    }

    reverse(st + , st + top + );

    dp[][] = ;

    dp[][] = (st[] - ) >> ;

    for(int i = ; i <= top; ++i)

    {

        dp[i][] = dp[i - ][] + dp[i - ][];

        dp[i][] = dp[i - ][] * ((st[i] - st[i - ]) >> ) + dp[i - ][] * ((st[i] - st[i - ] - ) >> );

    }

    cout << dp[top][] + dp[top][];

    return ;

}