#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))

long N;

long choose(int now, int is_less_count, int phase){ // is_less_count : is_less_x + is_less_y, phase : nothing -> hetero -> dominant homo
    if(phase == 2){
        if(is_less_count == 2){
            return power(4, now + 1, mod);
        }else if(is_less_count == 1){
            return power(2, now + 1, mod) * power(2, bitcount(N & ((1l << (now + 1)) - 1)), mod);
        }else{
            return power(4, bitcount(N & ((1l << (now + 1)) - 1)), mod);
        }
    }else if(now < 0){
        return false;
    }else if(is_less_count == 2){
        if(phase == 1){
            return (choose(now - 1, 2, 2) + choose(now - 1, 2, 1) * 3) % mod;
        }else{
            return (choose(now - 1, 2, 1) * 2 + choose(now - 1, 2, 0)) % mod;
        }
    }else if(is_less_count == 1 && ((N >> now) & 1)){
        return (choose(now - 1, 1, 2) + choose(now - 1, 1, 1) + choose(now - 1, 2, 1) * 2) % mod;
    }else if(is_less_count == 1){
        return choose(now - 1, 1, 1) * 2 % mod;
    }else if((N >> now) & 1){
        return (choose(now - 1, 1, 1) * 2 + choose(now - 1, 2, 0)) % mod;
    }else{
        return choose(now - 1, 0, phase) % mod;
    }
}

int main(){
    cin >> N;
    cout << choose(60, 0, 0) / 2 << endl;
}