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 <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64,i64> P;
#define rep(i,s,e) for(int i = (s);i <= (e);i++)

map<P,i64> dp;

i64 n;

i64 MOD = 1e9 + 7;

i64 rec(i64 s,i64 x)
{
    if(dp.count({s,x})) return dp[{s,x}];

    i64 result = 0;

    (result += rec(s / 2,x / 2)) %= MOD;
    if(s - 1 >= 0 && x - 1 >= 0)
        (result += rec((s - 1) / 2, (x - 1) / 2)) %= MOD;
    if(s - 2 >= 0)
        (result += rec((s - 2) / 2, x / 2)) %= MOD;

    return dp[{s,x}] = result;
}

int main()
{
    cin >> n;
    dp[{0,0}] = 1;
    cout << rec(n,n) << endl;
    return 0;
}