import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;

// sum of [a, a + d)
long calc(long a, long d) {
  long x = a + a + d - 1;
  long y = d;
  if (x % 2 == 0) {
    x /= 2;
  } else {
    y /= 2;
  }
  x %= MO;
  y %= MO;
  return (x * y) % MO;
}

void main() {
  try {
    for (; ; ) {
      const N = readLong();
      
      long ans;
      foreach (k; 0 .. 60) {
        if (((N + 1) >> k) & 1) {
          const a = (N + 1) & ~((1L << (k + 1)) - 1);
          debug {
            writefln("%s: [%s, %s)", k, a, a + 2L^^k);
          }
          ans += popcnt(a) * calc(a, 2L^^k);
          ans %= MO;
          foreach (l; 0 .. k) {
            // [2^l, 2^(l+1)) mod 2^(l+1)
            long tmp;
            tmp += (a % MO) * ((2L^^k / 2) % MO) % MO;
            tmp += calc(0, 2L^^(k - l - 1)) * (2L^^(l + 1) % MO) % MO * (2L^^l % MO) % MO;
            tmp += calc(2L^^l, 2L^^l) * (2L^^(k - l - 1) % MO) % MO;
            tmp %= MO;
            debug {
              if (N <= 2L^^10) {
                writeln("  ", l, ": ", tmp);
              }
            }
            ans += tmp;
            ans %= MO;
          }
        }
      }
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}