#include <cstdio>
#include <map>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
const ll maxn=1e18+5;
map <ll,ll> f;
ll Fc(ll x){
	if(f[x])return f[x];
	return f[x]=(Fc(x>>1)+Fc((x-1)>>1)+Fc((x-2)>>1))%mod;
}
int main(){
	ll n;
	scanf("%lld",&n);
	f[0]=1;f[1]=2;
	printf("%lld\n",Fc(n));
	return 0;
}