//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
}

//end of jonathanirvings' template v3.0.3 (BETA)

int f(int n)
{
  int risan = 0;
  FORN(u,0,n) FORN(v,0,n)
  {
    FORN(a,0,v)
    {
      int b = v - a;
      if ((a ^ b) == u)
      {
        ++risan;
        goto ok;
      }
    }
    ok:;
  }
  return risan;
}

int g(int n)
{
  int risan = 0;
  FORN(a,0,n) FORN(b,a,n)
  {
    if (a + b <= n) debug("%d %d %d %d\n",a,b,a^b,a+b);
    if (a + b <= n) ++risan;
  }
  return risan;
}

map<pair<LL,LL>,LL> dp;
unordered_map<LL,LL> dpa;
LL MOD = 1e9 + 7;
LL n;

LL a(LL n)
{
  if (dpa.count(n)) return dpa[n];
  if (n == 0) return 0;
  if (n == 1) return 1;
  if (n % 2 == 0) return dpa[n] = a(n/2);
  return dpa[n] = (a(n/2) + a(n/2+1)) % MOD;
}

inline LL sum(LL l, LL r)
{
  //if (l == 1) debug("%lld\n",r-l);
  //debug("%d %d\n",l,r);
  if (l > r) return 0;
  if (dp.count(mp(l,r))) return dp[mp(l,r)];
  if (l > 1)
  {
    return dp[mp(l,r)] = (sum(1,r) - sum(1,l-1) + MOD) % MOD;
  }
  if (r - l <= 2)
  {
    LL res = 0;
    for (LL i = l; i <= r; ++i) res += a(i);
    return dp[mp(l,r)] = res % MOD;
  }
  //LL &ret = dp[mp(l,r)];
  LL &res = dp[mp(l,r)];
  LL ret = 0;
  if (r % 2 == 1) 
  {
    ret = a(r);
    --r;
  }
  LL m = (l + r) >> 1;
  if (m % 2 == 1) ++m;
  ret += (sum(m/2,r/2) * 3 - a(m/2) - a(r/2)); // sum(m,r)
  //temp += sum(r/2+1,m-1);
  //temp += sum(m/2,min(m-1,r/2));
  //temp += sum(l,m/2-1);
  ret += sum(l,m-1);
  ret = (ret % MOD) + MOD;
  //debug("%lld %lld %lld\n",l,r,temp);
  return res = ret % MOD;
}

int main()
{
  scanf("%lld",&n);
  printf("%lld\n",sum(1,n+1));
  return 0;
  //VALUE(sum(1,8));
  //return 0;
  //FORN(i,1,10) FORN(j,i,10) debug("%d %d %lld\n",i,j,sum(i,j));
  FORN(i,1,30)
  {
    debug("%d %lld %d\n",i,sum(1,i+1),f(i));
    assert(sum(1,i+1) == f(i));
  }
  //VALUE(g(1000000000000000000LL));
  VALUE(sum(1,1000000000LL));
  VALUE(sum(1,1000000000000000001LL));
  //VALUE(sum(1,100LL));
  //FORN(i,1,10) debug("%lld\n",sum(1,i+1));
  //FORN(i,1,10) debug("%d\n",f(i));
  // FORN(i,1,20) debug("%d %d %d\n",i,f(i),f(i)-f(i-1));
  // int temp = 0;
  // FORN(i,1,20) 
  // {
  //   temp += f(i);
  //   debug("%d %d %d\n",i,f(i),temp);
  // }
  // FORN(i,1,20) 
  // {
  //   debug("%d %d %d\n",i,f(i),g(i));
  //   assert(f(i) == g(i));
  // }
  return 0;
}










Measured memory_bytes: 384