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>
#define MOD 1000000007
 
using namespace std;
typedef long long ll;

ll N;
int Bit[100];
ll dp[100][3];

int main(){

cin>>N;

int k=0;
while(N>0){
    if(N%2==1){
        Bit[k]=1;
    }
    N/=2;
    k++;
}

dp[0][0]=1LL; 

for(int i=0; i<k; i++){
    if(Bit[k-(i+1)]){
        dp[i+1][0]=dp[i][0]%MOD;
        dp[i+1][1]=(dp[i][0]+dp[i][1])%MOD;
        dp[i+1][2]=(2*dp[i][1]+3*dp[i][2])%MOD;
    }else{
        dp[i+1][0]=(dp[i][0]+dp[i][1])%MOD;
        dp[i+1][1]=dp[i][1]%MOD;
        dp[i+1][2]=(dp[i][1]+3*dp[i][2])%MOD;
    }
}

ll ans=(dp[k][0]+dp[k][1]+dp[k][2])%MOD;

cout<<ans<<endl;

return 0;
 
}