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

long long modpow(int n, int r) {
  long long ret = 1; long long tmp = (long long) n;
  while (r != 0) {
    if (r % 2) ret *= tmp;
    tmp *= tmp; tmp %= mod; ret %= mod;
    r /= 2;
  }
  return ret;
}

int main(){
  long long n; cin >> n;
  long long ans = 0; long long k = 0;
  long long inv2 = modpow(2, mod-2);
  long long c = n;
  while (c > 0) k++, c /= 2;
  for (int digit = 0; digit < k; digit++) {
    int di = digit + 1;
    if (n & (1 << digit)) {
      long long han = (n >> digit) << digit;
      long long tmp = ((n+han)%mod) * ((n-han+1)%mod);
      ans += ((tmp%mod)*inv2) % mod; ans %= mod;
    }
    long long u = (n >> di); long long v = (1 << digit);
    long long ini = (((v%mod)*((v-1)%mod))%mod)*inv2%mod;
    long long diff = (v*2%mod) * (v%mod) % mod;
    ans += (u % mod) * (((v%mod) * (v%mod)) % mod);
    ans %= mod;
    ans += (ini * u) % mod; ans %= mod;
    ans += (((((diff%mod)*(u%mod)%mod)*((u-1)%mod))%mod)*inv2)%mod;
  }
  cout << ans << endl;
  return 0;
}