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;

const int64_t MOD = 1e9+7;

void add(int64_t& a, int64_t b){
    a = (a+b)%MOD;
}
int nth_bit(int64_t num , int n) {
    return (num >> n) & 1;
}

int main() {
    int64_t N;
    cin >> N;

    int64_t dp[61][3] = {0};
    dp[60][0] = 1;

    for(int d = 59; d >= 0; d--) {
        for(int s = 0; s <= 2; s++) {
            for (int k = 0; k <= 2; k++) {
                int s2 = min(2, 2*s+nth_bit(N, d) - k);
                if (s2 >= 0) add(dp[d][s2], dp[d+1][s]);
            }

        }
    }


    int64_t ans = (dp[0][0] + dp[0][1] + dp[0][2]) % MOD;
    cout << ans << endl;
    return 0;
}