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>
#define llint long long
#define mod 1000000007

using namespace std;

llint n;
llint dp[65][2][2];

int main(void)
{
	cin >> n;
	
	dp[0][0][0]++, dp[0][0][1]++;
	if(n%2) dp[0][0][0]++; else dp[0][1][0]++;
	
	for(int i = 0; i <= 60; i++){
		for(int j = 0; j < 2; j++){
			for(int k = 0; k < 2; k++){
				
				for(int l = 0; l < 2; l++){
					for(int m = 0; m < 2; m++){
						if(l == 0 && m == 1) continue;
						int x = (k+l+m)%2, nk = (k+l+m)/2, nj = j;
						if( (n & (1LL<<(i+1))) == 0 && x == 1 ) nj = 1;
						if( (n & (1LL<<(i+1))) > 0 && x == 0 ) nj = 0;
						(dp[i+1][nj][nk] += dp[i][j][k]) %= mod;
					}
				}
				
			}
		}
	}
	cout << dp[61][0][0] << endl;
	
	return 0;
}