#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x% mod + mod) % mod) {}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};

ll N;
mint dp1[62][2][61], dp2[62][2][61]; //dp1は個数、dp2が答え
bool memo1[62][2][61], memo2[62][2][61];

mint dfs1(ll cur, int f, int cnt) {
	if (cur < 0) {
		if (cnt == 0) return 1;
		else return 0;
	}
	if (memo1[cur][f][cnt]) return dp1[cur][f][cnt];
	mint res = 0;
	if (f) {
		if ((N >> cur) & 1LL) {
			if(cnt > 0) res += dfs1(cur - 1, f, cnt - 1);
			res += dfs1(cur - 1, 0, cnt);
		}
		else {
			res += dfs1(cur - 1, f, cnt);
		}
	}
	else {
		if(cnt > 0) res += dfs1(cur - 1, 0, cnt - 1);
		res += dfs1(cur - 1, 0, cnt);
	}
	memo1[cur][f][cnt] = true;
	return dp1[cur][f][cnt] = res;
}

mint dfs2(ll cur, int f, int cnt) {
	if (cur < 0) {
		return 0;
	}
	if (memo2[cur][f][cnt]) return dp2[cur][f][cnt];
	mint res = 0;
	if (f) {
		if ((N >> cur) & 1LL) {
			if(cnt > 0 )res += dfs2(cur - 1, f, cnt - 1) + mint((1LL << cur) % mod) * dfs1(cur - 1, f, cnt - 1);
			res += dfs2(cur - 1, 0, cnt);
		}
		else {
			res += dfs2(cur - 1, f, cnt);
		}
	}else{
		if(cnt > 0) res += dfs2(cur - 1, 0, cnt - 1) + mint((1LL << cur) % mod) * dfs1(cur - 1, f, cnt - 1);
		res += dfs2(cur - 1, f, cnt);
	}
	memo2[cur][f][cnt] = true;
	return dp2[cur][f][cnt] = res;
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	scanf("%lld", &N);
	mint res = 0;
	for (ll cnt = 60; cnt >= 1; cnt--) {
		for (ll i = 0; i <= 60; i++)for (int j = 0; j < 2; j++)for (int k = 0; k <= 60; k++) {
			dp1[i][j][k] = 0;
			dp2[i][j][k] = 0;
			memo1[i][j][k] = false;
			memo2[i][j][k] = false;
		}
		dfs1(61, 1, cnt);
		res += dfs2(61, 1, cnt) * cnt;
		//cout << dfs2(61, 1, cnt).x << endl;
		//cout << res.x << endl;
	}
	cout << res.x << endl;

	return 0;
}