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 ll = int64_t; const ll MOD = 1e9+7;
int main(){
    ll N;
    cin >> N;
    ll keta = 0;
    while(pow(2, keta) <= N) keta++;
    ll dp[keta][3];
    dp[keta - 1][0] = 1;
    dp[keta - 1][1] = 1;
    dp[keta - 1][2] = 0;
    for(ll i = keta - 2; 0 <= i; i--){
        if((N >> i) & 1){
            dp[i][0] = dp[i + 1][0] * 1;
            dp[i][1] = dp[i + 1][0] + dp[i + 1][1];
            dp[i][2] = dp[i + 1][2] * 3 + dp[i + 1][1] * 2;
        }else{
            dp[i][0] = dp[i + 1][0] + dp[i + 1][1];
            dp[i][1] = dp[i + 1][1] * 1;
            dp[i][2] = dp[i + 1][2] * 3 + dp[i + 1][1];
        }
        for(int j = 0; j < 3; j++) dp[i][j] %= MOD;
    }
    cout << (dp[0][0] + dp[0][1] + dp[0][2]) % MOD << endl;
    return 0;
}