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;
typedef long long ll;
const long long mod = 1e9+7;
map<ll,ll> dp;

long long f(long long n) {
        if(dp[n])       return dp[n];
        return dp[n] =  (f(n/2)+f((n-1)/2)+f((n-2)/2))%mod;
}

long long solution(long long n) {
        return f(n)%mod;
}

int main() {
        long long n;
        cin>>n;
        dp[0] = 1;
        dp[1] = 2;
        cout<<solution(n)<<endl;
        return 0;
}
