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;
	while(cin >> N){
		long long dp[2][3];
		for(int i=0;i<3;i++) dp[0][i] = dp[1][i] = 0;
		dp[0][0] = 1;
		for(int i=60;i>=0;i--){
			long long* cur = dp[i%2];
			long long* next = dp[1-i%2];
			for(int j=0;j<3;j++) next[j] = 0;
			for(int j=0;j<3;j++){
				int r = 2*j + (N>>i)%2;
				for(int k=0;k<=2;k++){
					if(r-k < 0) break;
					next[min(2, r-k)] += cur[j];
				}
			}
			for(int j=0;j<3;j++) next[j] %= MOD;
		}
		int res = 0;
		for(int j=0;j<3;j++) res = (res + dp[1][j])%MOD;
		cout << res << endl;
	}
}
