#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
void add(long long &a, long long b) {
  a += b;
  a %= 1000000007;
}
const int N = 99;
long long dp[N][N], _dp[N][N], ans, v;
int n, i, j, b;
void solve() {
  gn(n);
  dp[32][0] = 1;
  for (i = 31; i >= 0; i--) {
    b = (n >> i) & 1;
    for (j = 0, v = 1; j < 32; j++, v = 1 << (j - 1)) {
      add(_dp[i][j], (1LL << j) * _dp[i + 1][j]);
      add(_dp[i][j + 1], _dp[i + 1][j]);
      if (!b)
        add(dp[i][j], v * dp[i + 1][j]);
      else {
        add(dp[i][j], ((1LL << j) - v) * dp[i + 1][j]);
        add(dp[i][j + 1], dp[i + 1][j]);
        add(_dp[i][j], v * dp[i + 1][j]);
      }
    }
  }
  for (i = 0; i <= 32; i++) add(ans, dp[0][i]), add(ans, _dp[0][i]);
  println(ans);
  return;
}
int main() {
  solve();
  return 0;
}
