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;

int main(){
    long long int N, M, m = 1000000007, a[64], k = 1, l = 0, c = 0, i, o = 1;
    scanf("%lld", &N);
    M = ((++N)^(N/2));
    for(i = 64; i; ++c){
        if(M & (o << --i)){
            swap(k, l);
            l += k * c;
            l %= m;
            c = 0;
        }
        a[i] = (N & (o << i))?l:(-l);
    }
    i = 0;
    for(k = 0, l = 1; i < 64 - __builtin_clzll(M); ++i){
        k += a[i] * l;
        l *= 3;
        k %= m;
        l %= m;
    }
    cout << (k + m) % m << endl;
    return 0;
}
