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;

long long int solve(long long int n,map<long long int,long long int> &dp){
    if(n==0) return 1;
    if(n==1) return 2;
    if(dp.find(n)!=dp.end()) return dp[n];
    long long int res=0;
    res+=solve(n/2,dp);
    res+=solve(n/2-1,dp);
    res+=solve((n-1)/2,dp);
    return dp[n]=(res%(int(1e9)+7));
}
int main(){
    long long int n;
    cin>>n;
    map<long long int,long long int> dp;
    cout<<solve(n,dp)<<endl;
    return 0;
}
