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 <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <queue>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fst first
#define snd second
const ll mod = 1000000007;
const ll INF = mod * mod;


/* dp[i][j][k] i:上からの桁、j:下一桁、k:iとのさ*/
ll dp[62][3] = {};

int main(){
	ll n;
	
	cin >> n;
	dp[61][0] = 1;
	for (int i = 60; i >= 0; i--) {
		if ((n & (1LL << i) )== 0LL) {
			dp[i][0] = (dp[i + 1][0] + dp[i+1][1]) % mod;
			dp[i][1] = dp[i+1][1];
			dp[i][2] = (3*dp[i + 1][2] + dp[i + 1][1]) % mod;
		}
		else {
			dp[i][0] = dp[i + 1][0];
			dp[i][1] = (dp[i + 1][0] + dp[i + 1][1]) % mod;
			dp[i][2] = (3*dp[i + 1][2] + 2*dp[i + 1][1]) % mod;
		}
	}
	cout << (dp[0][0] + dp[0][01] + dp[0][2]) % mod << endl;
	return 0;
}
