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
/*
 * @Date         : 2020-07-28 23:41:58
 * @Author       : ssyze
 * @Description  :
 */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
map<pair<ll, ll>, int> dp;
ll n;

ll dfs(ll u, ll v)
{
    if (v < 0) return 0;
    if (v == 0) return 1;
    if (dp[{u, v}]) return dp[{u, v}];
    ll ans = 0;
    ans = (ans + dfs(u >> 1, v >> 1)) % mod;
    ans = (ans + dfs((u - 1) >> 1, (v - 1) >> 1)) % mod;
    if (v >= 2) ans = (ans + dfs(u >> 1, (v - 2) >> 1)) % mod;
    return dp[{u, v}] = ans;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    cout << dfs(n, n) << '\n';
}