/* -*- coding: utf-8 -*-
 *
 * 737.cc:  No.737 PopCount - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

ll powmod(ll a, int b) {
  ll pm = 1;
  while (b) {
    if (b & 1) pm = pm * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return pm;
}

/* main */

int main() {
  ll n;
  scanf("%lld", &n);

  ll sum = 0, bk = 1;
  ll inv2 = powmod(2, MOD - 2);

  for (int k = 0; bk <= n; k++, bk <<= 1) {
    ll bk1 = bk << 1, bkm = bk % MOD, bk1m = bk1 % MOD;
    ll div = n / bk1, rem = n % bk1;
    ll divm = div % MOD;

    ll d0 = 0, d1 = 0, d2 = 0;
    d0 = (bk1 - 1 + bk) % MOD * bkm % MOD * inv2 % MOD * divm % MOD;
    if (div > 1)
      d1 =
	divm * ((div - 1) % MOD) % MOD * inv2 % MOD *
	bk1m % MOD * bkm % MOD;
    if (rem >= bk)
      d2 =
	(bk + rem) % MOD * ((rem - bk + 1) % MOD) % MOD * inv2 % MOD +
	divm * bk1m % MOD * ((rem - bk + 1) % MOD) % MOD;
    //printf("k=%d: div=%lld, rem=%lld, d=(%lld,%lld,%lld)\n",
    //k, div, rem, d0, d1, d2);

    sum = (sum + d0 + d1 + d2) % MOD;
  }

  printf("%lld\n", sum);
  return 0;
}