#include <cstdio>
using namespace std;

int dp[65][4][4];
const int MOD = 1000000007;

int main() {
    long long int N; scanf("%lld", &N);
    int M = 60;
    dp[M+1][0][0] = 1;

    for(int B=M; B>=0; B--) {
        for(int sat=0; sat<4; sat++) {
            for(int les=0; les<4; les++) {
                if(dp[B+1][sat][les] == 0) continue;
                // printf("dp[%d][%d][%d] = %d\n", B+1, sat, les, dp[B+1][sat][les]);
                int lim_x = (les >> 0 & 1 ? 1 : (N >> B & 1));
                int lim_y = (les >> 1 & 1 ? 1 : (N >> B & 1));
                for(int x=0; x<lim_x + 1; x++) {
                    for(int y=0; y<lim_y + 1; y++) {
                        int b1 = (x == 1 && y == 0);
                        int b2 = (x == 1 && y == 1);
                        int les1 = (les >> 0 & 1) || x < lim_x;
                        int les2 = (les >> 1 & 1) || y < lim_y;
                        if(!(sat >> 0 & 1) && b2) continue;
                        if(!(sat >> 0 & 1) && x == 0 && y == 1) continue;
                        
                        int nsat = sat | (b1 << 0) | (b2 << 1);
                        int nles = les | (les1 << 0) | (les2 << 1);
                        // printf("update: (%d, %d, %d) <= (%d, %d, %d)\n", B, nsat, nles, B+1, sat, les);
                        (dp[B][nsat][nles] += dp[B+1][sat][les]) %= MOD;
                    }
                }
            }
        }
    }
    int ans = 0;
    for(int i=0; i<4; i++) (ans += dp[0][3][i]) %= MOD;
    printf("%d\n", ans);
    return 0;
}