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 <iostream>
#include <algorithm>
#define MOD 1000000007
using namespace std;
typedef long long lli;
lli n;
lli dp[65][3];
lli d[65];

int main(int argc, char const *argv[]) {
    cin >> n;
    for(lli i = 63;i >= 0;i--,n /= 2){
        d[i] = n % 2;
    }
    dp[0][0] = 1;
    for(lli i = 0;i < 64;i++){
        if(d[i]){
            dp[i+1][0] = dp[i][0];
            dp[i+1][1] = (dp[i][0]+dp[i][1] )% MOD;
            dp[i+1][2] = (dp[i][1]+dp[i][1]+dp[i][2]+dp[i][2]+dp[i][2] )% MOD;
        }else{
            dp[i+1][0] = (dp[i][0]+dp[i][1]) % MOD;
            dp[i+1][1] = dp[i][1];
            dp[i+1][2] = (dp[i][1]+dp[i][2]+dp[i][2]+dp[i][2]) % MOD;
        }
    }
    cout << (dp[64][0] + dp[64][1] + dp[64][2]) % MOD << endl;
    return 0;
}
