#include<bits/stdc++.h>
#define ll long long
using namespace std;
map<ll,ll>dp;
ll mod=1e9+7;
ll f(ll x)
{
    if(x==0)return dp[0]=1;
    else if(x==1)return dp[1]=2;
    else if(dp[x])return dp[x];
    else
    {
    return dp[x]=(f(x/2)+f((x-1)/2)+f((x-2)/2))%mod;
    }
}
int main()
{

    ll x;
    cin>>x;
    cout<<f(x)<<endl;
}
