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 <cstring>
#include <algorithm>
#include <map>
#define i64 long long
using namespace std;

const int mo = 1e9 + 7;
i64 n;
map <i64, int> mp;

int calc(i64 n) {
	if (mp.count(n)) return mp[n];
	return mp[n] = ((calc(n >> 1) + calc((n - 1) >> 1)) % mo + calc((n - 2) >> 1)) % mo;
}

int main() {
	scanf("%lld", &n);
	mp[0] = 1;
	mp[1] = 2;
	printf("%d", calc(n));
	return 0;
}
