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<algorithm>
#include<cstring>
#include<map>
using namespace std;
map<int,int>num;
typedef long long ll;
const int N=1e6+10;
const int Mod=1e9+7;
ll cal(ll x){
    if(num[x]!=0) return num[x];
    return num[x]=(cal(x/2)+cal((x-1)/2)+cal((x-2)/2))%Mod;
}
int main(){
    num[0]=1;num[1]=2;
    ll n;
    scanf("%lld",&n);
    printf("%lld\n",cal(n));
    return 0;
}