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>
#define rep(i,n)for(int i=0;i<(n);i++)
#define MOD 1000000007
using namespace std;
typedef long long ll;

ll dp[61][3];
int main() {
	ll n; scanf("%lld", &n);
	dp[60][0] = 1;
	for (int i = 60; i > 0; i--)rep(j, 3)rep(k, 3) {
		ll a = min(2LL, j * 2 + (n >> (i - 1) & 1) - k);
		if (a >= 0)(dp[i - 1][a] += dp[i][j]) %= MOD;
	}
	printf("%lld\n", (dp[0][0] + dp[0][1] + dp[0][2]) % MOD);
}