#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; }

// ---- ----

LL MOD = -1;
LL mod(LL x, LL m = MOD) { return (x % m + m) % m; }
pair<LL, LL> ex_gcd(LL a, LL b) {
	if(b == 0) { return MP(1, 0); }
	auto p = ex_gcd(b, a % b);
	return MP(p.SE, p.FI - (a / b) * p.SE);
}
LL inv(LL x, LL m = MOD) {
	assert(gcd(x, m) == 1);
	auto p = ex_gcd(x, m);
	return mod(p.FI, m);
}
LL promod(LL x, LL y, LL m = MOD) { return mod((x % m) * (y % m), m); }
LL divmod(LL x, LL y, LL m = MOD) { return promod(x, inv(y, m), m); }

// ----

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

LL n, dp[61][2][2][2][2][2][2];

int main() {
	MOD = 1e9 + 7;
	cin >> n;
	
	dp[60][1][0][1][1][0][0] = 1;
	dec(i, 60) {
		inc(t, 2) {
		inc(u, 2) {
		inc(v, 2) {
		inc(w, 2) {
		inc(x, 2) {
		inc(y, 2) {
		inc(tt, 2) {
		inc(uu, 2) {
		inc(vv, 2) {
		inc(ww, 2) {
		inc(xx, 2) {
		inc(yy, 2) {
			if(
				(
					(t == 0 && tt == 0) ||
					(t == 1 && tt == 0 && xx != yy) ||
					(t == 1 && tt == 1 && xx == 0 && yy == 0)
				) && (
					(u == 1 && uu == 1) ||
					(u == 0 && uu == 1 &&    xx == 1 && yy == 1) ||
					(u == 0 && uu == 0 && ! (xx == 1 && yy == 1))
				) && (
					(v == 0 && vv == 0) ||
					(v == 1 && vv == 0 && xx <  bit(n, i)) ||
					(v == 1 && vv == 1 && xx == bit(n, i))
				) && (
					(w == 0 && ww == 0) ||
					(w == 1 && ww == 0 && yy <  bit(n, i)) ||
					(w == 1 && ww == 1 && yy == bit(n, i))
				)
			) {
				(dp[i][tt][uu][vv][ww][xx][yy] += dp[i + 1][t][u][v][w][x][y]) %= MOD;
			}
		}
		}
		}
		}
		}
		}
		}
		}
		}
		}
		}
		}
	}
	
	LL ans = 0;
	inc(v, 2) {
	inc(w, 2) {
	inc(x, 2) {
	inc(y, 2) {
		(ans += dp[0][0][1][v][w][x][y]) %= MOD;
	}
	}
	}
	}
	
	cout << divmod(ans, 2) << endl;
	
	return 0;
}