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

enum mod = 10^^9 + 7;

void main() {
    long n;
    scan(n);

    string nb = format("%b", n);
    int L = nb.length.to!int;
    auto dp = new long[][][][](L+1, 2, 2, 2);
    dp[0][0][0][0] = 1;

    foreach (i ; 0 .. L) {
        foreach (mim ; 0 .. 2) {
            foreach (top ; 0 .. 2) {
                foreach (eq ; 0 .. 2) {
                    foreach (y ; 0 .. 2) {
                        foreach (x ; 0 .. 2) {
                            if (!mim && (nb[i] - '0') < y) {
                                continue;
                            }
                            if (!top && (x == 1)) {
                                continue;
                            }
                            (dp[i+1][mim | ((nb[i] - '0') > y)][top | (y == 1)][eq | (y == 1 && x == 1)] += dp[i][mim][top][eq]) %= mod;
                        }
                    }
                }
            }
        }
    }

    long ans;
    ans += dp[L][0][1][1];
    ans %= mod;
    ans += dp[L][1][1][1];
    ans %= mod;

    writeln(ans);
}

void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}