#include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;

const int M = 1000000007;
const int iM = 500000004;

int main() {
    long long n;
    cin >> n;
    long long sum = 0;
    for (int i = 0; n >> i; ++i) {
        long long c = (n + 1) / (1L << (i + 1)) * (1L << i);
        long long m = (c * 2 - 1) % M * (c * 2 % M) % M * iM % M;
        sum = (sum + (m + c % M * ((1L << i) % M) % M) % M * iM % M) % M;
        if ((n + 1) % (1L << (i + 1)) >= (1L << i)) {
            sum = (sum + (c * 2 + (1L << i) % M + n) % M * ((n - c * 2 - (1L << i) + 1) % M) % M * iM) % M;
        }
    }
    cout << sum << "\n";
    return 0;
}