#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

#define bit(b, i) (((b) >> (i)) & 1)

LL n, dp[61][2][2][2], MOD = 1e9 + 7;

int main() {
	cin >> n;
	n++;
	
	dp[60][0][0][0] = 1;
	dec(i, 60) {
		inc(f1, 2) {
		inc(g1, 2) {
		inc(h1, 2) {
		inc(f2, 2) {
		inc(g2, 2) {
		inc(h2, 2) {
		inc(y, 2) {
		inc(x, 2) {
			if(
				(
					(f1 == 0 && f2 == y && x == 0) ||
					(f1 == 1 && f2 == 1)
				) && (
					(g1 == 0 && ((g2 == 1) == (y == 1 && x == 1))) ||
					(g1 == 1 && g2 == 1)
				) && (
					(h1 == 0 && h2 == 0 && y == bit(n, i)) ||
					(h1 == 0 && h2 == 1 && y <  bit(n, i)) ||
					(h1 == 1 && h2 == 1)
				)
			) {
				(dp[i][f2][g2][h2] += dp[i + 1][f1][g1][h1]) %= MOD;
			}
		}
		}
		}
		}
		}
		}
		}
		}
	}
	
	cout << dp[0][1][1][1] << endl;
	
	return 0;
}