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 <bits/stdc++.h>

using namespace std;

using i64 = int64_t;

const i64 MOD = 1e9+7;

const i64 INF = 1e18+7;


signed main(){

    i64 n;
    cin >> n;

    unordered_map<int,i64> m;
    m[0] = 0;
    m[1] = 1;

    function<i64(i64)> g = [&](i64 x){
        if(m.find(x) != m.end())
            return m[x];

        if(x & 1){
            return m[x] = (2 * g(x >> 1) + g((x >> 1) + 1)) % MOD;
        }else{
            return m[x] = (2 * g(x >> 1) + g((x >> 1) - 1)) % MOD;
        }
    };

    cout << g(n + 1) << endl;
    return 0;

}
