#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__",", __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000
#define MOD 1000000007

long dp[2005][2005][2];
int n;

long solve(int i, int j, bool last=false){
  if(i==n-1){
    if(last) return j!=n;
    else return 1;
  }
  if(dp[i][j][last]>=0) return dp[i][j][last];

  long ret = 0;
  if(i==0) for(int k=j; k<=n; k++) ret += solve(i+1,k,j==1);
  else for(int k=max(j-i+1,1); k<=n; k++) ret += solve(i+1, k, last);
  return dp[i][j][last] = ret%MOD;
}

int main(){
  cin>>n;
  fill(dp[0][0], dp[n+1][0], -1);
  long ans = 0;
  rep(i,n) ans += solve(0,i+1);
  cout << ans %MOD << endl;

  return 0;
}