#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
int main()
{
	ll n; cin>>n;
	if(n==0){
		cout<<0<<endl;
		return 0;
	}
	string s;
	int d=0;
	while(n){
		s+=('0'+(n&1));
		d++;
		n>>=1;
	}
	reverse(s.begin(), s.end());
	ll dp[2][2][61]={}; //y<N, (1, 1)な桁があるか
	dp[0][0][0]=1;
	for(int i=1; i<d; i++) dp[1][0][i]=1;
	for(int i=0; i<d-1; i++){
		if(s[i+1]=='0'){
			dp[0][0][i+1]=(dp[0][0][i+1]+2*dp[0][0][i])%MOD;
			dp[1][0][i+1]=(dp[1][0][i+1]+3*dp[1][0][i])%MOD;
			dp[0][1][i+1]=(dp[0][1][i+1]+2*dp[0][1][i])%MOD;
			dp[1][1][i+1]=(dp[1][1][i+1]+4*dp[1][1][i]+dp[1][0][i])%MOD;
		}else{
			dp[1][0][i+1]=(dp[1][0][i+1]+2*dp[0][0][i]+2*dp[1][0][i])%MOD;
			dp[1][1][i+1]=(dp[1][1][i+1]+2*dp[0][1][i]+2*dp[1][1][i])%MOD;
			dp[0][0][i+1]=(dp[0][0][i+1]+dp[0][0][i])%MOD;
			dp[0][1][i+1]=(dp[0][1][i+1]+dp[0][0][i]+2*dp[0][1][i])%MOD;
			dp[1][0][i+1]=(dp[1][0][i+1]+dp[1][0][i])%MOD;
			dp[1][1][i+1]=(dp[1][1][i+1]+dp[1][0][i]+2*dp[1][1][i])%MOD;
		}
	}
	cout<<(dp[0][1][d-1]+dp[1][1][d-1])%MOD<<endl;
	return 0;
}