#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename Q_temp>
using smaller_queue = priority_queue <Q_temp, vector<Q_temp>, greater<Q_temp> >;

const ll MOD = (ll) (1e9 + 7);
const int INF = (int) 1e9;
const ll LINF = (ll) 4e18;
const double PI = acos(-1.0);

#define REP(i,m,n) for(ll i = m; i < (ll)(n); ++i)
#define rep(i,n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbg2(x_) for(auto a_ : x_) cerr << a_ << " "; cerr << endl;
#define dbg3(x_ , sx_) rep(i, sx_) cerr << x_[i] << " "; cerr << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

inline ll CEIL(ll a, ll b) {
    return (a + b - 1) / b;
}

void finish() {
    cout << -1 << endl;
    exit(0);
}

//------------------------------------------------------

template<int MOD> struct Fp {
    long long val;

    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) v += MOD;
    }

    constexpr int getmod() {
        return MOD;
    }

    constexpr Fp operator-() const noexcept {
        return val ? MOD - val : 0;
    }

    constexpr Fp operator+(const Fp& r) const noexcept {
        return Fp(*this) += r;
    }

    constexpr Fp operator-(const Fp& r) const noexcept {
        return Fp(*this) -= r;
    }

    constexpr Fp operator*(const Fp& r) const noexcept {
        return Fp(*this) *= r;
    }

    constexpr Fp operator/(const Fp& r) const noexcept {
        return Fp(*this) /= r;
    }

    constexpr Fp& operator+=(const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }

    constexpr Fp& operator-=(const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }

    constexpr Fp& operator*=(const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }

    constexpr Fp& operator/=(const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }

    constexpr bool operator==(const Fp& r) const noexcept {
        return this->val == r.val;
    }

    constexpr bool operator!=(const Fp& r) const noexcept {
        return this->val != r.val;
    }

    friend constexpr ostream& operator<<(ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }

    friend constexpr istream& operator>>(istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }

    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

using mint = Fp<MOD>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(20) << setiosflags(ios::fixed);

    ll n;
    cin >> n;
    const int bitset_size = 70;
    bitset<bitset_size> bs_temp(n), bs;
    rep(i, bitset_size) bs[i] = bs_temp[bitset_size - i - 1];

    mint dp[bitset_size + 1][3] = {}; //上位i桁まで見て，繰り上がりをj回許容する(a,b)の個数
    //同じ桁のbitを入れ替えてできるものは同一視

    dp[0][0] = 1;

    rep(i, bitset_size) {
        if (bs[i] == 0) {
            //コメントはi+1番目のbit
            dp[i + 1][0] += dp[i][0]; //(0,0)
            dp[i + 1][0] += dp[i][1]; //(1,1)
            dp[i + 1][1] += dp[i][1]; //(1,0)
            dp[i + 1][2] += dp[i][1]; //(0,0)
            dp[i + 1][2] += dp[i][2] * 3; //(0,0),(1,0),(1,1)
        } else {
            dp[i + 1][0] += dp[i][0]; //(1,0)
            dp[i + 1][1] += dp[i][0]; //(0,0)
            dp[i + 1][1] += dp[i][1]; //(1,0)
            dp[i + 1][2] += dp[i][1] * 2; //(0,0),(1,0)
            dp[i + 1][2] += dp[i][2] * 3; //(0,0),(1,0),(1,1)
        }

    }

    mint sum = 0;
    rep(i, 3) sum += dp[bitset_size][i];
    cout << sum << endl;
    return 0;
}


Measured memory_bytes: 256