#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll n; cin >> n;
    bitset<100> f(n);
    ll ans = 0;
    const ll MOD = 1000000007;
    ll keep = 0;
    ll cnt = 0;
    drep(k,100){
        if(f[k]){
            if(k == 0){
                ;
            }else if(k == 1){
                ans++;
            }else{
                ans += ((1LL<<k) - 1) % MOD * (((1LL<<(k-1)) + (k-1)*(1LL<<(k-2)))%MOD);
            }
            ans += cnt * (((1LL<<k)-1)%MOD) % MOD * ((1LL<<(k-1))%MOD) % MOD;
            ans %= MOD;
            ans += keep * ((1LL<<k)%MOD) % MOD * cnt % MOD;
            ans %= MOD;
            ans += keep * k % MOD * ((1LL<<(k-1))%MOD) % MOD;
            keep += 1LL<<k;
            cnt++;
            keep %= MOD;

            // cout << k << ' ' << ans << endl;
        }
    }
    cnt = 0;
    rep(i,100)cnt += f[i];
    ans += n % MOD * cnt;
    ans %= MOD;
    cout << ans << endl;
    return 0;
}