#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os; }

template<long long MOD>
class ModInt {
public:
	const static long long mod = MOD;
	long long x;
	
	ModInt() {
		x = 0;
	}

	ModInt(long long x) {
		this->x = x < 0 ? (x+mod)%mod : x%mod;
	}

	int get() const {
		return (int)x;
	}

	ModInt &operator+=(ModInt that) {
		if((x += that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(ModInt that) {
		if((x += mod-that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(ModInt that) {
		x = x*that.get()%mod;
		return *this;
	}

	ModInt &operator/=(ModInt that) {
		return *this *= that.inverse();
	}

	ModInt operator+(ModInt that) const {
		return ModInt(*this) += that;
	}

	ModInt operator-(ModInt that) const {
		return ModInt(*this) -= that;
	}

	ModInt operator*(ModInt that) const {
		return ModInt(*this) *= that;
	}

	ModInt operator/(ModInt that) const {
		return ModInt(*this) /= that;
	}

	ModInt inverse() const {
		using std::swap;
		long long a = x, b = mod, u = 1, v = 0;
		while(b) {
			long long t = a/b;
			a -= t*b; swap(a,b);
			u -= t*v; swap(u,v);
		}
		return ModInt(u);
	}

	ModInt pow(long long x){
		ModInt t = *this;
		ModInt res = 0;
		while(x != 0) {
			if(x&1){
				res += t;
			}
			t = t*t;
			x >>= 1;
		}
		return res;
	}

	bool operator==(ModInt that) const { return x == that.get(); }
	bool operator!=(ModInt that) const { return x != that.get(); };
	ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }

};


const int mod = 1e9+7;
template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { cout << m.get(); return os; }
typedef ModInt<mod> mint;

long long modpow(long long a, long long b, long long modd = mod){
	a %= modd;
	if(a == 0) return 0;
	long long res = 1;
	while(b != 0){
		if(b&1) res = res*a%modd;
		a = a*a%modd;
		b >>= 1;
	}
	return res;
}


#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

int naive(LL n){
	set<P> s;
	REP(i,1000){
		REP(j,1000){
			int u = i+j;
			int v = i^j;
			if(u <= n and v <= n) s.emplace(u,v);
		}
	}
	return s.size();
}

int main()
{
	ios_init();
	LL n;
	while(cin >> n) {
		int cnt = 0;
		LL n_ = n;
		while(n_ != 0){
			cnt++;
			n_ >>= 1;
		}
		// vector<mint> dp(cnt);
		// vector<mint> dp1(cnt);
		// dp[0] = 2;
		// dp1[0] = 1;
		// // dp1[0] = 1;
		// REP(i,cnt-1){
		// 	dp[i+1] = dp[i]*2+dp1[i];
		// 	dp1[i+1] = dp1[i]*2+dp[i];
		// }
		// dpite(ALL(dp)); dpite(ALL(dp1));
		// cout << naive(n) << endl;
		vector<vector<mint>> dp(cnt+1,vector<mint>(3));
		dp[cnt][0] = 1;
		mint ans = 0;
		RREP(i,cnt){
			DEBUG(i);
			int b = (n>>i)&1;
			REP(j,3){
				REP(k,3){
					int d = b-k+2*j;
					if(0 <= d){
						if(d <= 2){
							dp[i][d] += dp[i+1][j];
						}else{
							ans += dp[i+1][j]*modpow(3,i);
							DEBUG(ans);
						}
					}
				}
			}
		}
		REP(i,cnt+1) dpite(ALL(dp[i]));
		ans += dp[0][0]+dp[0][1]+dp[0][2];
		cout << ans << endl;
		// cout << naive(n) << endl;
	}
	return 0;
}


Measured memory_bytes: 256