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
// Problem : D - Xor Sum
// Contest : AtCoder Regular Contest 066
// URL : https://atcoder.jp/contests/arc066/tasks/arc066_b
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#include <iostream>
#include <map>
#define MOD 1000000007
using namespace std;
map<long long,long long> f;
long long dfs(long long x)
{
 if(f[x])return f[x];
 else return f[x]=(dfs(x/2)+dfs((x-1)/2)+dfs((x-2)/2))%MOD;
}
int main()
{
 long long n;
 cin>>n;
 f[0]=1,f[1]=2;
 cout<<dfs(n)<<endl;
 return 0;
}