3006

#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int main() {
    ifstream fin("input.txt");
    ofstream fout("output.txt");

    int n;
    fin >> n;
    vector<vector<long long>> dp(2, vector<long long>(n+1));
    dp[0][0] = 1LL;
    for (int i = 1; i <= n; i++) {
        for (int k = 0; k < i; k++) {
            dp[0][i] += dp[0][k] * dp[0][i - k - 1];
            dp[0][i] %= (1000 * 1000 * 1000 + 7);
            dp[1][i] += dp[0][k] * dp[1][i - k - 1]
                + dp[0][k] * dp[0][i - k - 1] + dp[0][k] * dp[1][i - k - 1]
                + dp[1][k] * dp[0][i - k - 1] + dp[1][k] * dp[1][i - k - 1];
            dp[1][i] %= (1000 * 1000 * 1000 + 7);
        }
    }
    fout << (dp[0][n] + dp[1][n]) % (1000 * 1000 * 1000 + 7) << endl;

    fin.close();
    fout.close();
    return 0;
}