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 <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#define ll long long
ll mod=1e9+7;
using namespace std;
map<ll,ll>q;
ll a[100];
ll solve(ll n){
    if (q[n]){
        return q[n];
    }
    if (n==0){
        return q[n]=1;
    }
    if (n==1){
        return q[n]=2;
    }
    if (n%2==0){
        return q[n]=(2*solve(n/2-1)+solve(n/2))%mod;
    }
    if (n%2){
        return q[n]=(solve(n/2-1)+2*solve(n/2))%mod;
    }
}
int main(){
    ll n;
    scanf("%lld",&n);
    solve(n);
    printf("%lld\n",q[n]);
    return 0;
}
