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<map>
#include<cstdio>
#include<iostream>
#define ooo(msg, ...) printf("(%s #%d) " msg, __FUNCTION__, __LINE__, __VA_ARGS__);
using namespace std;
typedef long long ll;
const int mo = 1e9+7;
ll n;
map < ll , ll > dp;
ll f(ll n) {
	return dp.count(n) ? dp[n] : dp[n] = (f(n / 2) % mo + f((n - 1) / 2) % mo + f((n - 2) / 2)% mo) % mo;
}
int main() {
	scanf("%lld", &n);
	dp[0] = 1; dp[1] = 2;
	printf("%lld\n", f(n));
	return 0;	
}
