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;
typedef pair<int,int> pii;
const int INF=~(1<<31),MAXN=1e6+10;
const int MOD=1e9+7;

map<ll,ll> mp;

ll dfs(ll now)
{
    ll ans=0;
    if(mp[now])return mp[now];
    if(now==1)return 2;
    if(now==0)return 1;
    if(now&1)
    {
        ans+=2*dfs(now/2);
        ans+=dfs(now/2-1);
    }
    else
    {
        ans+=dfs(now/2);
        ans+=2*dfs(now/2-1);
    }
    mp[now]=ans%MOD;
    return ans%MOD;
}

int main()
{
    ll n;
    scanf("%lld",&n);
    cout<<dfs(n);
	return 0;
}
