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;

typedef long long ll;
typedef unsigned long long ull;
const ll MOD=1e9+7;

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

    ll dp[64][3];
    dp[0][0]=1;
    dp[0][1]=dp[0][2]=0;
    for(int i=1;i<64;i++){
        int Nb=(N&(1LL<<(63-i)))!=0;
        dp[i][0]=dp[i][1]=dp[i][2]=0;
        for(int j=0;j<=2;j++){
            for(int k=0;k<=2;k++){
                if(j*2-k+Nb>=0){
                    dp[i][min(j*2-k+Nb,2)]=(dp[i][min(j*2-k+Nb,2)]+dp[i-1][j])%MOD;
                }
            }
        }
    }

    cout << (dp[63][0]+dp[63][1]+dp[63][2])%MOD << endl;
    return 0;
}