#include <bits/stdc++.h>
using namespace std;

const int M = int(1e9 + 7);

int invmod(int v) {
  int r = 1;
  for (int n = M - 2; n; n /= 2) {
    if (n & 1) r = 1LL * r * v % M;
    v = 1LL * v * v % M;
  }
  return r;
}

signed main() {
  ios::sync_with_stdio(false);

  int64_t N;
  cin >> N;

  vector<int> s;
  for (int64_t n = N; n; n /= 2) s.emplace_back(n & 1);
  reverse(s.begin(), s.end());

  vector<vector<vector<int>>> dp(s.size() + 1, vector<vector<int>>(2, vector<int>(s.size() + 1)));
  dp[0][0][0] = 1;
  vector<vector<vector<int>>> dpdp(s.size() + 1, vector<vector<int>>(2, vector<int>(s.size() + 1)));
  for (int i = 0; i < s.size(); ++i) {
    for (int j = 0; j < 2; ++j) {
      for (int k = 0; k <= i; ++k) {
        for (int d = 0; d <= (j ? 1 : s[i]); ++d) {
          (dp[i + 1][j | d < s[i]][k + d] += dp[i][j][k]) %= M;
          (dpdp[i + 1][j | d < s[i]][k + d] += (1LL * dpdp[i][j][k] * (k + d) % M * invmod(k) % M + (1LL * d << s.size() - 1 - i) % M * (k + d) % M * dp[i][j][k] % M) % M) %= M;
        }
      }
    }
  }

  int ans = 0;
  for (int i = 1; i <= s.size(); ++i)
    for (int j = 0; j < 2; ++j)
      (ans += dpdp[s.size()][j][i]) %= M;
  
  cout << ans << endl;
}