#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))

#define MOD 1000000007

long long dp[2017];
long long fact[2017];
long long rfact[2017];

long long modpow(long long a, long long b){ 
  long long r = 1LL;

  while(b){
    if(b & 1LL)r *= a;
    if(r >= MOD)r %= MOD;
    a *= a;
    if(a >= MOD)a %= MOD;
    b >>= 1LL;
  }
  return r;
}

long long nCr(long long n, long long r){ 
  long long ret = 1LL;
  ret *= fact[n];
  ret %= MOD;
  ret *= rfact[r];
  ret %= MOD;
  ret *= rfact[n-r];
  ret %= MOD;
  return ret;
}

int main(){
  clr(fact,0);
  fact[0]=1;
  rep(i,1,2017){
    fact[i] = fact[i-1]*i;
    fact[i] %= MOD;
  }
  clr(rfact,0);
  rfact[0]=1;
  rep(i,1,2017){
    rfact[i] = rfact[i-1]*modpow(i,MOD-2);
    rfact[i] %= MOD;
  }
  int n;
  cin>>n;
  clr(dp,0);
  dp[0]=2;
  dp[1]=2;
  dp[2]=2;
  rep(i,3,2017){
    rep(j,0,i){
      dp[i] += (((nCr(i-1,j)*dp[j])%MOD)*dp[i-1-j]%MOD)*modpow(4,MOD-2)%MOD;
      dp[i] %= MOD;
    }
  }
  cout << dp[n] << endl;
  return 0;
}