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>
using namespace std;
long dp[66][3],m=1e9+7,n;
int b;
int main(){
cin>>n;
dp[60][0]=1;
for(int i=59;i>=0;i--){
b=(n>>i)&1;
for(int j=0;j<3;j++){
for(int k=0;k<3;k++){
if(j*2+b>=k){
(dp[i][min(j*2+b-k,2)]+=dp[i+1][j])%=m;
}
}
}
}
cout<<(dp[0][0]+dp[0][1]+dp[0][2])%m<<endl;
}
