You are given a positive integer N. Find the number of the pairs of integers u and v (0≦u,v≦N) such that there exist two non-negative integers a and b satisfying a xor b=u and a+b=v. Here, xor denotes the bitwise exclusive OR. Since it can be extremely large, compute the answer modulo 10^9+7.

Constraints

* 1≦N≦10^{18}

Input

The input is given from Standard Input in the following format:


N


Output

Print the number of the possible pairs of integers u and v, modulo 10^9+7.

Examples

Input

3


Output

5


Input

1422


Output

52277


Input

1000000000000000000


Output

787014179
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
using ll = long long;

const int MOD = (int)1e9 + 7;
struct mint { int n; mint(int n = -1) : n(n) { } };     // default: -1
mint operator+(mint a, mint b) { return (a.n += b.n) >= MOD ? a.n - MOD : a.n; }
bool operator!=(mint a, mint b) { return a.n != b.n; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
ostream &operator<<(ostream &os, mint a) { return os << a.n; }

map<pair<ll, ll>, mint> memo;

mint func(ll s, ll x) {
    if (memo[{s, x}] != -1) return memo[{s, x}];
    if (s == 0) return 1;
    mint res = func(s / 2, x / 2);
    if (s && x) res += func((s - 1) / 2, (x - 1) / 2);
    if (s > 1) res += func((s - 2) / 2, x / 2);
    return memo[{s, x}] = res;
}

int main() {
    ll n; cin >> n;
    cout << func(n, n) << endl;
    return 0;
}