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 int mod = 1e9 + 7;

void upd(int &x, int y) {
    if ((x += y) >= mod) {
        x -= mod;
    }
}

int main() {
    long long n;
    cin >> n;

    static int dp[62][3]; // borrow
    dp[0][0] = 1;

    for (int i = 0; i < 61; i++) {
        for (int j = 0; j < 3; j++) {
            for (int x = 0; x < 2; x++) {
                for (int y = x; y < 2; y++) {
                    int s = ((n >> i & 1) - x - y - j);
                    if (s < 0) {
                        upd(dp[i + 1][(1 - s) / 2], dp[i][j]);
                    } else {
                        upd(dp[i + 1][0], dp[i][j]);
                    }
                }
            }
        }
    }

    cout << dp[61][0] << endl;
}
