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;

#define mod 1000000007

typedef long long ll;

ll N;
ll dp[100][5] = {0};

int main()
{
    scanf("%lld",&N);
    dp[61][0] = 1;
    for(int i = 60; i >= 0; i--)
    {
        ll mem = (N >> i) & 1;
        dp[i][2] += dp[i + 1][2] * 3;
        if(mem)
        {
            dp[i][2] += dp[i + 1][1] * 2;
            dp[i][1] += dp[i + 1][1];
            dp[i][1] += dp[i + 1][0];
            dp[i][0] += dp[i + 1][0];
        }
        else
        {
            dp[i][2] += dp[i + 1][1];
            dp[i][1] += dp[i + 1][1];
            dp[i][0] += dp[i + 1][1];
            dp[i][0] += dp[i + 1][0];
        }
        dp[i][0] %= mod;
        dp[i][1] %= mod;
        dp[i][2] %= mod;
    }
    printf("%lld\n",(dp[0][0] + dp[0][1] + dp[0][2]) % mod);
    return 0;
}
