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)); }


/*
  (0, 0): 0 0 0
  (0, 1): 0 1 1
  (1, 0): 0 1 1
  (1, 1): 1 0 1
*/

enum MO = 10L^^9 + 7;

long N;

long[][][][][] dp;

// x < y, y < N, (x & y) < (x ^ y), (x ^ y) < (x | y)
long calc(in int pos, in int a, in int b, in int c, in int d) {
  if (pos == -1) {
    return (c && d) ? 1 : 0;
  }
  long ret = dp[pos][a][b][c][d];
  if (ret == -1) {
    ret = 0;
    foreach (x; 0 .. 2) foreach (y; 0 .. 2) {
      if ((a || x <= y) && (b || y <= ((N >> pos) & 1)) && (c || (x & y) <= (x ^ y)) && (d || (x ^ y) <= (x | y))) {
        ret += calc(pos - 1, (a || x < y), (b || y < ((N >> pos) & 1)), (c || (x & y) < (x ^ y)), (d || (x ^ y) < (x | y)));
        ret %= MO;
      }
    }
    debug {
      if (pos < 10) {
        writeln(pos, " ", a, " ", b, " ", c, " ", d, ": ", ret);
      }
    }
    dp[pos][a][b][c][d] = ret;
  }
  return ret;
}

void main() {
  try {
    for (; ; ) {
      N = readLong();
      
      const len = bsr(N + 1);
      debug {
        writeln("len = ", len);
      }
      dp = new long[][][][][](len, 2, 2, 2, 2);
      foreach (pos; 0 .. len) foreach (a; 0 .. 2) foreach (b; 0 .. 2) foreach (c; 0 .. 2) foreach (d; 0 .. 2) {
        dp[pos][a][b][c][d] = -1;
      }
      const ans = calc(len - 1, 0, 0, 0, 0);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}