#include <bits/stdc++.h>

using namespace std;
 
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
 
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define in(x, a, b) a <= x && x < b
const int inf = 1000000001;
const ll INF = 2e18;
const ll MOD = 1000000007;
//const ll mod = 1000000009;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p <<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

ll mod_pow(ll x, ll p, ll M = MOD) {
	ll a = 1;
	while (p) {
		if (p % 2)
			a = a*x%M;
		x = x*x%M;
		p /= 2;
	}
	return a;
}

ll mod_inverse(ll a, ll M = MOD) {
	return mod_pow(a, M - 2, M);
}



int main() {
  ll n;
  cin >> n;
  int ketanum = 1;
  ll mask = 1;
  rep1 (i, 62) {
    mask <<= 1;
    //cout << mask << endl;
    if (n & mask) {
      ketanum = i + 1;
    }
  }
  vector<vector<vll> > dp(ketanum + 1, vector<vll>(4, vll(2, vl(2))));
  dp[0][0][0][0] = 1;
  rep (keta, ketanum) {
    ll mask = 1LL << keta;
    rep (state, 4) {
      rep (up, 2) {
	rep (up2, 2) {
	  int nketa = keta + 1;
	  if ((mask & n) == 0) {
	    dp[nketa][3][0][1] += dp[keta][state][up][up2];
	    dp[nketa][3][0][1] %= MOD;
	    dp[nketa][state][up][up2] += dp[keta][state][up][up2];
	    dp[nketa][state][up][up2] %= MOD;
	    dp[nketa][state | 2][1][up2] += dp[keta][state][up][up2];
	    dp[nketa][state | 2][1][up2] %= MOD;
	    dp[nketa][state | 1][1][up2] += dp[keta][state][up][up2];
	    dp[nketa][state | 1][1][up2] %= MOD;
	  }
	  else {
	    dp[nketa][state][0][1] += dp[keta][state][up][up2];
	    dp[nketa][state][0][1] %= MOD;
	    dp[nketa][0][up][up2] += dp[keta][state][up][up2];
	    dp[nketa][0][up][up2] %= MOD;
	    dp[nketa][state & 2][1][up2] += dp[keta][state][up][up2];
	    dp[nketa][state & 2][1][up2] %= MOD;
	    dp[nketa][state & 1][1][up2] += dp[keta][state][up][up2];
	    dp[nketa][state & 1][1][up2] %= MOD;
	  }
	}
      }
    }
  }
  cout << dp[ketanum][0][1][1] * mod_inverse(2) % MOD  << endl;
}