#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
const double pi=acos(-1.0);
const double eps=1e-9;
const ll mod=1e9+7;
map<ll,ll>m;
ll solve(ll n)
{
    if(m[n])return m[n];
    return m[n]=(solve(n/2)+solve((n-1)/2)+solve((n-2)/2))%mod;
}
int main()
{
    ll n;scanf("%lld",&n);
    m[0]=1,m[1]=2;
    printf("%lld\n",solve(n));
    return 0;
}
