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 <iostream>
#include <cstring>

using namespace std;

long long N;
long long dp[61][3];

long long search(int digit = 60, int prevDif = 0){
	if(prevDif < 0) return 0;
	if(digit < 0) return 1;
	if(dp[digit][prevDif] >= 0) return dp[digit][prevDif];
	long long res = 0;
	for(int add=0;add<=2;add++){
		int newDif = min<int>(2, 2 * prevDif + (N>>digit)%2 - add);
		res = (res + search(digit-1, newDif)) % 1000000007;
	}
	return dp[digit][prevDif] = res;
}

int main(){
	while(cin >> N){
		memset(dp, -1, sizeof(dp));
		cout << search() << endl;
	}
}
