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>

using namespace std;

const int MOD = 1000000007;

int main(){
	long long N;
	long long dp[2][3];
	while(cin >> N){
		fill(dp[0], dp[0]+3, 0);
		dp[0][0] = 1; dp[0][1] = 0; dp[0][2] = 0;
		for(int i=60;i>=0;i--){
			fill(dp[1], dp[1]+3, 0);
			for(int j=0;j<3;j++){
				long long prevSum = (N >> (i+1)) - j;
				for(int k=0;k<3;k++){
					long long newDif = (N >> i) - (2 * prevSum + k);
					if(newDif < 0) continue;
					newDif = min(newDif, 2LL);
					dp[1][newDif] += dp[0][j];
					dp[1][newDif] %= MOD;
				}
			}
			copy(dp[1], dp[1]+3, dp[0]);
		}
		long long res = 0;
		for(int i=0;i<3;i++) res = (res + dp[0][i]) % MOD;
		cout << res << endl;
	}
}
