#include <map>
#include <stack>
#include <set>
#include <iostream>
#include <vector>

using namespace std;

const int M = 1000000007;

int newCat(vector<long long>C, int n)
{
 int target = 0;
 for (int i = 0; i < n; i++)
 {
  target = (target+C[i] * C[n - i - 1])%M;
 }
 return target;
}

int newD(vector<long long>D, vector<long long>C, int n)
{
 int target = 0;
 for (int i = 0; i < n; i++)
 {
  target = (target+C[i] * D[n - i - 1] + D[i] * D[n - 1 - i])%M;
 }
 return target;
}

int main()
{
 int n;
 cin >> n;
 vector<long long>D(n + 1);
 vector<long long>C(n + 1);
 D[0] = 1;
 C[0] = 1;
 for (int i = 1; i < n + 1; i++)
 {
  C[i] = newCat(C, i);
  D[i] = newD(D, C, i);
 }

 cout << D[D.size() - 1];

}