#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class T> istream& operator>>(istream& is,vector<T>& v) { for(T& t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { rep(i,v.size())os<<v[i]<<(i==v.size()-1?"\n":" "); return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
    ll x;
    mint(ll x=0):x((x%mod+mod)%mod){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint& a) { if ((x += a.x) >= mod) x -= mod; return *this;}
    mint& operator++() { return *this += mint(1); }
    mint& operator-=(const mint& a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; }
    mint& operator--() { return *this -= mint(1); }
    mint& operator*=(const mint& a) { (x *= a.x) %= mod; return *this; }
    mint operator+(const mint& a) const { mint res(*this); return res+=a; }
    mint operator-(const mint& a) const { mint res(*this); return res-=a; }
    mint operator*(const mint& a) const { mint res(*this); return res*=a; }
    mint pow(ll t) const {
        mint res = mint(1),a(*this);
        while(t > 0) {
            if(t&1) res *= a;
            t >>= 1;
            a *= a;
        }
        return res;
    }
    // for prime mod
    mint inv() const { return pow(mod-2); }
    mint& operator/=(const mint& a) { return *this *= a.inv(); }
    mint operator/(const mint& a) const { mint res(*this); return res/=a; }
};
ostream& operator<<(ostream& os,const mint& m) { return os << m.x; }

mint dp[70][2][3];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    ll n;
    cin >> n;
    string s;
    while(n > 0) {
        s.pb('0'+(n&1));
        n >>= 1;
    }
    reverse(all(s));
    int sz = s.size();
    dp[0][0][0] = 1;
    rep(i,sz) {
        int now = s[i]-'0';
        // 0,0
        {
            if(now) {
                // (a,b) = (0,0)
                dp[i+1][1][1] += dp[i][0][0];
                // (a,b) = (1,0)
                dp[i+1][0][0] += dp[i][0][0];
            } else {
                // (a,b) = (0,0)
                dp[i+1][0][0] += dp[i][0][0];
            }
        }
        // 1,0
        {
            if(now) {
                // (a,b) = (0,0)
                dp[i+1][1][1] += dp[i][1][0];
                // (a,b) = (1,0)
                dp[i+1][1][0] += dp[i][1][0];
            } else {
                // (a,b) = (0,0)
                dp[i+1][1][0] += dp[i][1][0];
            }
        }
        // 1,1
        {
            if(now) {
                // (a,b) = (0,0)
                dp[i+1][1][2] += dp[i][1][1];
                // (a,b) = (1,0)
                dp[i+1][1][2] += dp[i][1][1];
                // (a,b) = (1,1)
                dp[i+1][1][1] += dp[i][1][1];
            } else {
                // (a,b) = (0,0)
                dp[i+1][1][2] += dp[i][1][1];
                // (a,b) = (1,0)
                dp[i+1][1][1] += dp[i][1][1];
                // (a,b) = (1,1)
                dp[i+1][1][0] += dp[i][1][1];
            }
        }
        // 1,2
        {
            // (a,b) = (0,0)
            dp[i+1][1][2] += dp[i][1][2];
            // (a,b) = (1,0)
            dp[i+1][1][2] += dp[i][1][2];
            // (a,b) = (1,1)
            dp[i+1][1][2] += dp[i][1][2];
        }
    }
    mint ans;
    rep(i,2) rep(j,3) ans += dp[sz][i][j];
    cout << ans << endl;
//    rep(i,3) rep(j,2) rep(k,3) cout << dp[i][j][k] << endl;
}


Measured memory_bytes: 256