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;
#define int long long


 const int MAX = 1001;
const int MOD = 1000000007;



signed main(){
 
   int n;
   cin>>n;
   int k=0,o=1;
   while(n>=(o<<k))k++;
   int dp[k][3];
    dp[0][0]=1;
    dp[0][1]=1;
    dp[0][2]=0;
    for(int i=1;i<k;i++){
        if(1&(n>>(k-i-1))){
            dp[i][0]=dp[i-1][0];
            dp[i][1]=(dp[i-1][0]+dp[i-1][1])%MOD;
            dp[i][2]=(dp[i-1][2]*3+dp[i-1][1]*2)%MOD;
        }else{
            dp[i][0]=(dp[i-1][0]+dp[i-1][1])%MOD;
            dp[i][1]=dp[i-1][1];
            dp[i][2]=(dp[i-1][2]*3+dp[i-1][1])%MOD;
        }
    }

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