#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_map>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<string>
#include<iomanip>

using namespace std;

#define INF 1 << 29
#define LL long long int

LL const MOD = 1000000007;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL n;
    cin >> n;

    vector<vector<LL>> dpa(61,vector<LL>(61,0)),dpb(61,vector<LL>(61,0));
    dpa[0][0] = 1;

    LL x = 1;

    for(int i = 1; i < 61; i++){
        for(LL j = 0; j < 61; j++){
            dpa[i][j] += dpa[i-1][j];
            dpa[i][j] %= MOD;
            if(j > 0){
                dpa[i][j] += dpa[i-1][j-1];
                dpa[i][j] %= MOD;
            }
        }
    }

    for(int i = 1; i < 61 && x <= n; i++){
        for(LL j = 0; j <= i; j++){
            dpb[i][j] += dpb[i-1][j];
            if(j > 0){
                dpb[i][j] += ((dpa[i-1][j-1]*x)%MOD + dpb[i-1][j-1])%MOD;
                dpb[i][j] %= MOD;
            }
        }
        x *= 2;
        x %= MOD;
    }

    LL bitlen = 1;
    LL b = 2;
    while(b <= n){
        bitlen++;
        b *= 2;
    }

    LL ans = 0;
    LL pos = 0;
    LL y = 0;
    LL t = 1;
    for(int i = 1; i < bitlen; i++){
        t *= 2;
    }

    for(int i = bitlen; i > 0; i--){
        if(t&n){
            for(LL j = 0; j <= i; j++){
                ans += (((j+pos)%MOD)*((dpb[i-1][j]+(y*dpa[i-1][j])%MOD)%MOD))%MOD;
                ans %= MOD;
            }
            pos++;
            y += t%MOD;
            y %= MOD;
        }
        t /= 2;
    }

    ans += (pos*(n%MOD))%MOD;
    ans %= MOD;

    cout << ans << endl;
    
    return 0;
}