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 ll M = 1000000007;
ll n;
map<ll, ll> mp;

ll f(ll x){
	if(__builtin_popcount(x) == 1) return 1;
	if(mp.find(x) != mp.end()) return mp[x];
	ll t; for(t = 1; t <= x; t <<= 1); t /= 2;
	if(x > 3 * t / 2) x = 3 * t - x;
	return mp[x] = (f(x - t) + f(x - t / 2)) % M;
}

ll g(ll x){
	if(x == 1) return 2;
	return (3 * g(x / 2) - (2 - (x & 1)) * f(x / 2 + 1) + 2 * M) % M;
}

int main(){
	scanf("%lld", &n);
	printf("%lld\n", g(n));
}