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 <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MOD=1e9+7;
typedef long long ll;
typedef pair<ll,ll> P;

const ll MAX_N=1e18;
const int MAX_LOG_N=60;

ll N;

ll memo[MAX_LOG_N+1][3];

ll dfs(int n,int i){
	if (n<0) return 1;
	if (memo[n][i]!=-1) return memo[n][i];
	ll res=0;
	REP(j,3){
		if ((i<<1)+(N>>n&1)-j>=0){
			res+=dfs(n-1,min((i<<1)+(int)((N>>n)&1)-j,2));
		}
	}
	res%=MOD;
	return memo[n][i]=res;
}

int main(){
	memset(memo,-1,sizeof(memo));
	scanf("%lld",&N);
	printf("%lld\n",dfs(MAX_LOG_N,0));
	return 0;
}