#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using PII = pair<int, int>;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<V<T>>;
template <typename T> using VVV = vector<VV<T>>;

#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 INF = (1LL<<60);
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};

ll binpow(ll x, ll e, ll mo=MOD) {
  ll a = 1, p = x;
  while(e > 0) {
    if(e%2 == 0) {p = (p*p) % mo; e /= 2;}
    else {a = (a*p) % mo; e--;}
  }
  return a;
}

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  // // V<int> x(1e6);
  // int now = 0;
  // FOR(i, 1, 1e9) {
  //   (now += i * __builtin_popcountll(i)) %= MOD;
  //   // x[i] = x[i-1] + i * __builtin_popcount(i);
  //   // x[i] %= MOD; 
  //   if(i%1000000 == 0) cout << i << endl;
  //   if(now == 123456789) {
  //     cout << "i=" << i << " " << now << endl;
  //     break;
  //   }
  // }
  // cout << now << endl;
  // return 0;

  int n;
  cin >> n;

  // for(int n=1; n<1e6; ++n) {

  int m = 0;
  int tn = n;
  while(tn) {
    tn /= 2;
    m++;
  }

  V<int> sum(m);
  for(int i=0, j=2; i<m; ++i, j*=2) {
    int jj = j % MOD;
    sum[i] = jj * (jj-1) / 2 % MOD;
  }
  for(int i=m-1; i>=1; --i) {
    sum[i] = ((sum[i] - sum[i-1]) % MOD + MOD) % MOD;
  }

  // cout << sum << endl;

  int ans = 0;
  REP(i, m) {
    int len = 1LL<<(i+1);
    int t = n / len;
    int r = n % len;
    // cout << len << " " << t << " " << r << endl;
    len %= MOD; t %= MOD; r %= MOD;
    // t周期
    int l2 = len * binpow(2, MOD-2) % MOD;
    (ans += t * sum[i]) %= MOD;
    (ans += l2 * l2 % MOD * t % MOD * (t+MOD-1) % MOD) %= MOD;
    // cout << t * sum[i] << endl;
    // cout << (1LL<<i) << "," << n%len << endl;
    // 余りの分
    if((1LL<<i) <= n%(1LL<<(i+1))) {
      int tmp1 = ((r - l2 + 1) % MOD + MOD) % MOD;
      tmp1 = len * t % MOD * tmp1;
      int tmp2 = r*(r+1)/2 % MOD - l2*(l2-1)/2 % MOD;
      tmp2 = (tmp2%MOD+MOD)%MOD;
      (ans += (tmp1+tmp2) % MOD) %= MOD;
    }

    // cout << "i=" << i << " " << ans << endl;
  }

  cout << (ans%MOD+MOD)%MOD << endl;
  // if(ans != x[n]) {
  //   cout << n << " " << ans << " " << x[n] << endl;
  // }

  // }

  return 0;
}