#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll MOD = 1e9 + 7;
int main() {
  ll N;
  cin >> N;
  ll keta = 0;
  if (N == 1) {
    cout << 3 << endl;
    return 0;
  }
  while (pow(2, keta) < N) keta++;
  ll dp[keta][3];
  dp[keta - 1][0] = 1;
  dp[keta - 1][1] = 1;
  dp[keta - 1][2] = 0;
  for (ll i = keta - 2; 0 <= i; i--) {
    if ((N >> i) & 1) {
      dp[i][0] = dp[i + 1][0] * 1;
      dp[i][1] = dp[i + 1][0] + dp[i + 1][1];
      dp[i][2] = dp[i + 1][2] * 3 + dp[i + 1][1] * 2;
    } else {
      dp[i][0] = dp[i + 1][0] + dp[i + 1][1];
      dp[i][1] = dp[i + 1][1] * 1;
      dp[i][2] = dp[i + 1][2] * 3 + dp[i + 1][1];
    }
    for (int j = 0; j < 3; j++) dp[i][j] %= MOD;
  }
  cout << (dp[0][0] + dp[0][1] + dp[0][2]) % MOD << endl;
  return 0;
}
