#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e15;

int dp[61][61][2];
int sum[61][61][2];

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	int l;
	for(int i = 59; i >= 0; i--){
		if(n & (1LL << i)){
			l = i; break;
		}
	}
	rep(i, 0, 61) rep(j, 0, 61) rep(k, 0, 2) dp[i][j][k] = 0;
	dp[l + 1][0][0] = 1;
	for(int i = l; i >= 0; i--){
		for(int j = 0; j < 60; j++){
			if(dp[i + 1][j][0] != 0){
				if(n & (1LL << i)){
					(dp[i][j + 1][0] += dp[i + 1][j][0]) %= mod; // 1
					(sum[i][j + 1][0] += (sum[i + 1][j][0] + ((1LL << i) % mod * dp[i + 1][j][0] % mod)) % mod) %= mod;
					(dp[i][j][1] += dp[i + 1][j][0]) %= mod; // 0
					(sum[i][j][1] += sum[i + 1][j][0]) %= mod;
				}else{
					(dp[i][j][0] += dp[i + 1][j][0]) %= mod; // 0
					(sum[i][j][0] += sum[i + 1][j][0]) %= mod;
				}
			}
			if(dp[i + 1][j][1] != 0){
				(dp[i][j + 1][1] += dp[i + 1][j][1]) %= mod; // 1
				(sum[i][j + 1][1] += (sum[i + 1][j][1] + ((1LL << i) % mod * dp[i + 1][j][1] % mod)) % mod) %= mod;
				(dp[i][j][1] += dp[i + 1][j][1]) %= mod; // 0
				(sum[i][j][1] += sum[i + 1][j][1]) %= mod;
			}
		}
	}
	int ans = 0;
	for(int i = 0; i < 60; i++){
		// cout << i << " " << sum[0][i][0] << ' ' << sum[0][i][1] << endl;
		(ans += (sum[0][i][0] + sum[0][i][1]) % mod * i % mod) %= mod;
	}
	cout << ans << endl;
}