#include <bits/stdc++.h>
using namespace std;
namespace std {
template <class S, class T>
struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T>
struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v) h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
}  // namespace std
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < (int)v.size(); i++)
    os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v) os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v) os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
const int mod = 1e9 + 7;
long long N;
int in[20], n, dp[20][2][2][2];
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cin >> N;
  for (; N; N /= 2) in[n++] = N % 2;
  reverse(in, in + n);
  dp[0][0][0][0] = 1;
  for (int i = 0; i < (int)n; i++)
    for (int xs = 0; xs < (int)2; xs++)
      for (int ss = 0; ss < (int)2; ss++)
        for (int sc = 0; sc < (int)2; sc++)
          if (dp[i][xs][ss][sc])
            for (int a = 0; a < (int)2; a++)
              for (int b = 0; b < (int)a + 1; b++)
                for (int nc = 0; nc < (int)2; nc++) {
                  int nx = a ^ b;
                  int ns = a + b + nc;
                  if (sc != (ns >> 1)) continue;
                  if (!xs && nx > in[i]) continue;
                  if (!ss && (ns & 1) > in[i]) continue;
                  int nxs = xs || nx < in[i];
                  int nss = ss || (ns & 1) < in[i];
                  (dp[i + 1][nxs][nss][nc] += dp[i][xs][ss][sc]) %= mod;
                }
  long long ans = 0;
  for (int i = 0; i < (int)2; i++)
    for (int j = 0; j < (int)2; j++) ans += dp[n][i][j][0];
  cout << ans % mod << endl;
  return 0;
}
