#include<bits/stdc++.h>
#include<bits/extc++.h>
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
#define maxn 1234567
#define eps 1e-7
#define mod 1000000007
#define Mod 998244353
#define f(i,a,b) for(int i=a;i<=b;i++)
#define r(i,a,b) for(int i=a;i>=b;i--) 
#define fx(i,a,b,x) for(int i=a;i<=b;i+=x)
#define rx(i,a,b,x) for(int i=a;i>=b;i-=x) 
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
int T;
int qpow(int a,int n,int m){
	int ans=1;
	while(n){
		if(n&1)ans=ans*a%m;
		a=a*a%m;
		n>>=1;
	}
	return ans;
}
int n,inv=qpow(2,mod-2,mod),ans,x;
void solve(){
	scanf("%lld",&n);
	f(i,0,log2(n)){
		int x=(n+1)/(1<<(i+1))*(1<<i);
		ans=(ans+((x*2-1)%mod*(x*2%mod)%mod*inv%mod+x%mod*((1<<i)%mod)%mod)%mod*inv%mod)%mod;
		if((n+1)%(1<<(i+1))>=(1<<i))ans=(ans+(x*2+(1<<i)%mod+n)%mod*((n-x*2-(1<<i)+1)%mod)%mod*inv)%mod;
	}
	printf("%lld\n",ans);
}
signed main(){
	T=1;
//	scanf("%lld",&t);
	while(T--)solve();
	return 0;
}