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;

typedef long long ll;
 
using tpl = tuple<int, int, int>;
typedef pair<int,int> pii;

void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}

const int mod = 1000000000 + 7;

ll dp[61][3];
ll N;

ll rec(int pos, int k){
    if(pos < 0){
        return 1;
    }
    if(dp[pos][k] >= 0) return dp[pos][k];
    ll res = 0;
    int nk_base = k * 2;
    if((N >> pos) & 1) nk_base++;
    
    for(int i = 0; i < 3; i++){
        int nk = nk_base;
        nk -= i;
        if(nk >= 0)
            (res += rec(pos - 1, min(2, nk))) %= mod;
    }
    return dp[pos][k] = res;
}

int main(){

    cin >> N;
    memset(dp, -1, sizeof(dp));
    cout << rec(60, 0) << endl;

    return 0;
}
