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 <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;

ll mod=1e9+7;
 
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n; cin >> n;
    ll dp[61][3]={};
    dp[60][0]=1;
    for(int i=59;i>=0;i--){
        for(int j=0;j<=2;j++){
            for(int k=0;k<=2;k++){
                int kk=min(2,2*j+(int)((n>>i)&1)-k);
                if(kk>=0){
                    (dp[i][kk]+=dp[i+1][j])%=mod;
                }
            }
        }
    }
    cout << (dp[0][0]+dp[0][1]+dp[0][2])%mod << endl;
}