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 <map>

using namespace std;
using ll = long long;

const ll MOD = 1000000007;

map<ll, ll> dp;
ll rec(ll N) {
    if (N < 0) return 0;
    if (N == 0) return 1;
    if (dp.count(N)) return dp[N];

    dp[N] = rec((N - 1) / 2);              // 奇数
    dp[N] += rec(N / 2);                   // 偶数 最下位が共に0
    if (N > 1) dp[N] += rec((N - 2) / 2);  // 偶数 最下位が共に1
    return dp[N] %= MOD;
}

int main() {
    ll N;
    cin >> N;
    cout << rec(N) << endl;
    return 0;
}
