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;
#define MOD 1000000007

int main() {
    long long N;
    cin >> N;

    int dp[61][3] = {};
    dp[60][0] = 1;

    for(int d=59; d>=0; --d) {
        for(int s=0; s<3; ++s) {
            for(int k=0; k<3; ++k) {
                int tmp = min(2, 2 * s + (int)((N >> d) & 1) - k);
                if(tmp >= 0) dp[d][tmp] = (dp[d][tmp] + dp[d+1][s]) % MOD;
            }
        }
    }

    int res = (dp[0][0] + dp[0][1]) % MOD;
    res = (res + dp[0][2]) % MOD;
    cout << res << endl;
}