#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll to(ll x, ll nx) {
    if (x == 0 && nx == 1) {
        return 0;
    }
    return 1;
}

int main() {
    ll N;
    cin >> N;
    // x も upper か、y も upper か、今の状態は何に相当するか
    vector dp(61, vector(2, vector(2, vector<mint>(3, mint(0)))));
    dp[0][0][0][0] = mint(1);

    for (ll i = 0; i < 60; i++) {
        if ((N >> (59 - i)) & 1) {
            // 1 なら状態変化なし 0 なら必ず 1 となる
            // ありえる状態は
            // 0: (0, 0) か (0, 1) のいずれかのみ
            // 1: 全部いけて、(1, 1) の場合のみ次の状態へ
            // 2: 全部いける
            for (ll j = 0; j < 2; j++) {
                for (ll k = 0; k < 2; k++) {
                    for (ll l = 0; l < 3; l++) {
                        for (ll m = 0; m < 2; m++) {
                            for (ll n = 0; n < 2; n++) {
                                if (l == 0) {
                                    if (m == 0 && n == 0) {
                                        dp[i + 1][1][1][0] += dp[i][j][k][l];
                                    } else if (m == 0 && n == 1) {
                                        dp[i + 1][1][k][1] += dp[i][j][k][l];
                                    }
                                } else if (l == 1) {
                                    if (m == 1 && n == 1) {
                                        dp[i + 1][j][k][2] += dp[i][j][k][l];
                                    } else {
                                        dp[i + 1][to(j, m)][to(k, n)][1] +=
                                            dp[i][j][k][l];
                                    }
                                } else {
                                    dp[i + 1][to(j, m)][to(k, n)][l] +=
                                        dp[i][j][k][l];
                                }
                            }
                        }
                    }
                }
            }
        } else {
            // 常に状態変化なし
            // j = 0 かつ m = 1 とかは不可
            // 0: (0, 0) か (0, 1) のいずれかのみ
            // 1: 全部いけて、(1, 1) の場合のみ次の状態へ
            // 2: 全部いける
            for (ll j = 0; j < 2; j++) {
                for (ll k = 0; k < 2; k++) {
                    for (ll l = 0; l < 3; l++) {
                        for (ll m = 0; m < 2; m++) {
                            for (ll n = 0; n < 2; n++) {
                                if (j < m) {
                                    continue;
                                }
                                if (k < n) {
                                    continue;
                                }
                                if (l == 0) {
                                    if (m == 0 && n == 0) {
                                        dp[i + 1][j][k][0] += dp[i][j][k][l];
                                    } else if (m == 0 && n == 1) {
                                        dp[i + 1][j][k][1] += dp[i][j][k][l];
                                    }
                                } else if (l == 1) {
                                    if (m == 1 && n == 1) {
                                        dp[i + 1][j][k][2] += dp[i][j][k][l];
                                    } else {
                                        dp[i + 1][j][k][1] += dp[i][j][k][l];
                                    }
                                } else {
                                    dp[i + 1][j][k][l] += dp[i][j][k][l];
                                }
                            }
                        }
                    }
                }
            }
        }
        if (i >= 56) {
            mint ans2 = mint(0);
            for (ll j = 0; j < 2; j++) {
                for (ll k = 0; k < 2; k++) {
                    ans2 += dp[i + 1][j][k][2];
                }
            }
            // debug_out(ans2.val());
        }
    }
    mint ans = mint(0);
    for (ll i = 0; i < 2; i++) {
        for (ll j = 0; j < 2; j++) {
            ans += dp[60][i][j][2];
        }
    }
    cout << ans.val() << endl;
}