#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
/* using mint = modint<998244353>; */
using mint = modint<1000000007>;
long long N;
mint dp[2][1 << 2][2];
void solve()
{
	cin >> N;
	string S;
	while(N)
	{
		S += char('0'+(N&1));
		N >>= 1;
	}
	reverse(S.begin(),S.end());
	N = S.size();
	int cur = 0;
	for(int i = 0;i < N;i++)
	{
		int nxt = 1-cur;
		for(int j = 0;j < 1 << 2;j++)for(int k = 0;k < 2;k++) dp[nxt][j][k] = 0;
		int D = S[i]-'0';
		for(int j = 0;j < 1 << 2;j++)for(int k = 0;k < 2;k++)
		{
			for(int d = 0;d <= (j&1 ? 1:D);d++)for(int u = 0;u <= (j&2 ? 1:D);u++)
			{
				int nj = j;
				if(d < D) nj |= 1 << 0;
				if(u < D) nj |= 1 << 1;
				int nk = k || (d == u && d == 1);
				dp[nxt][nj][nk] += dp[cur][j][k];
			}
		}
		int u = 1,d = 0;
		int j = 0;
		if(i > 0) j = 3;
		if(d < D) j |= 1 << 0;
		if(u < D) j |= 1 << 1;
		dp[nxt][j][0]++;
		swap(cur,nxt);
	}
	mint ans = 0;
	for(int i = 0;i < 1 << 2;i++) ans += dp[cur][i][1];
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}