#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  int n;
  cin>>n;
  if(n<3){
    cout<<0<<endl;
    return 0;
  }

  // O E I S
  // A000111 or A001250
  // OEISは神

  map<ll,ll> A;
  A[-1] = 0;
  A[0] = 2;
  ll k=0;
  ll e=1;
  REP(i,n+2){
    ll Am = 0;
    A[k+e] = 0;
    e = -e;
    REP(j,i){
      Am += A[k];
      Am %= MOD;
      A[k] = Am;
      k += e;
    }
  }
  ll i = n+1;
  ll res;
  if(i%2==0)res = A[-i/2+1];
  else res = A[i/2];

  cout<<res<<endl;

  return 0;
}