#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'[';
  REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
  out<<']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int dp[65][2][2][3];
signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;

  int m = 0, n_ = n;
  while(n_ > 0) {
    m++;
    n_ /= 2;
  }
  // cout << m << endl;

  dp[0][0][0][0] = 1;
  REP(i, m) REP(j, 2) REP(k, 2) REP(l, 2) {
    if(dp[i][j][k][l] == 0) continue;
    // cout << i << " " << j << " " << k << " " << l << " " << dp[i][j][k][l] << " ";
    int lim = j?1:(n>>(m-i-1)&1);
    // cout << lim << endl;
    // (0,0)
    // cout << i+1 << " " << (j||0<lim) << " " << k << " " << l << endl;
    (dp[i+1][j || 0<lim][k][l] += dp[i][j][k][l]) %= MOD;
    // (1,0)
    if(l == 1) {
      // cout << i+1 << " " << (j||0<lim) << " " << k << " " << l << endl;
      (dp[i+1][j || 0<lim][k][l] += dp[i][j][k][l]) %= MOD;
    }
    if(lim == 1) {
      // (0,1)
      int cond = l==0?1:l;
      // cout << i+1 << " " << j << " " << k << " " << cond << endl;
      (dp[i+1][j][k][cond] += dp[i][j][k][l]) %= MOD;
      // (1,1)
      cond = l==0?2:l;
      // cout << i+1 << " " << j << " " << 1 << " " << cond << endl;
      (dp[i+1][j][1][cond] += dp[i][j][k][l]) %= MOD;
    }
  }

  int ans = 0;
  REP(i, 2) {
    (ans += dp[m][i][1][1]) %= MOD;
    // cout << i << " " << ans << endl;
  }
  cout << ans << endl;

  return 0;
}