#include using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec(i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define PQ priority_queue #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it) #define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it) template bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } } template bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } } template bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } } template bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } } template T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } // ---- ---- template class ModInt { private: LL v = 0; static LL m; public: ModInt() { } ModInt(LL vv) { setval(vv); } ModInt & setval(LL vv) { v = vv % m; if(v < 0) { v += m; } return (*this); } static void setmod(LL mm) { m = mm; } LL getval() const { return v; } ModInt & operator+=(const ModInt & b) { return setval(v + b.v); } ModInt & operator-=(const ModInt & b) { return setval(v - b.v); } ModInt & operator*=(const ModInt & b) { return setval(v * b.v); } ModInt & operator/=(const ModInt & b) { return setval(v * b.inv()); } ModInt & operator^=( LU b) { return setval(ex(v, b)); } ModInt operator+ ( ) const { return ModInt(+v); } ModInt operator- ( ) const { return ModInt(-v); } ModInt operator+ (const ModInt & b) const { return ModInt(v + b.v); } ModInt operator- (const ModInt & b) const { return ModInt(v - b.v); } ModInt operator* (const ModInt & b) const { return ModInt(v * b.v); } ModInt operator/ (const ModInt & b) const { return ModInt(v * b.inv()); } ModInt operator^ ( LU b) const { return ModInt(ex(v, b)); } LL inv() const { LL x = (ex_gcd(v, m).FI + m) % m; assert(v * x % m == 1); return x; } LL ex(LL a, LU b) const { LL D = 64, x[64], y = 1; inc(i, D) { if((b >> i) == 0) { D = i; break; } } inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % m; } inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= m; } } return y; } pair ex_gcd(LL a, LL b) const { if(b == 0) { return MP(1, 0); } auto p = ex_gcd(b, a % b); return MP(p.SE, p.FI - (a / b) * p.SE); } }; template LL ModInt::m; template ModInt operator+(LL a, const ModInt & b) { return b + a; } template ModInt operator-(LL a, const ModInt & b) { return -b + a; } template ModInt operator*(LL a, const ModInt & b) { return b * a; } template ModInt operator/(LL a, const ModInt & b) { return a * b.inv(); } template istream & operator>>(istream & is, ModInt & b) { LL v; is >> v; b.setval(v); return is; } template ostream & operator<<(ostream & os, const ModInt & b) { return (os << b.getval()); } // ---- ---- #define bit(b, i) (((b) >> (i)) & 1) ModInt<> g(ModInt<> x) { return x * (x - 1) / 2; } ModInt<> f(ModInt<> x, ModInt<> y) { return g(y) - g(x); } int main() { LL n; cin >> n; n++; ModInt<>::setmod(1e9 + 7); ModInt<> ans = 0; inc(k, 60) { ModInt<> s[61], c[61]; incID(i, k + 1, 60) { ModInt<> H = ModInt<>(2) ^ (i - 1); ModInt<> F = ModInt<>(2) ^ (i); s[i] = (i == k + 1 ? f(H, F) : 2 * s[i - 1] + H * c[i - 1]); c[i] = H; } LL t = 0; decID(i, k + 1, 60) { if(! bit(n, i)) { continue; } ans += s[i] + t * c[i]; t += 1LL << i; } ans += f(min(t + (1LL << k), n), n); } cout << ans << endl; return 0; }