#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
const int N = 1e3 + 10, P = 1e9 + 7;

int n, dp[N][N], pp[N][N];

int main() {
    cin >> n;
    
    dp[0][0] = 1;
    for(int i = 1; i <= n; i ++)
        for(int j = i; j <= n; j ++) {
            dp[i][j] = dp[i][j - i] + dp[i - 1][j - i];
            if(dp[i][j] >= P) dp[i][j] -= P;
        }
    
    pp[n + 1][0] = pp[n + 2][0] = 1;
    for(int i = n; i >= 1; i --) {
        memcpy(pp[i], pp[i + 1], sizeof pp[i]);
        for(int j = i; j <= n; j ++) {
            pp[i][j] += pp[i][j - i];
            if(pp[i][j] >= P) pp[i][j] -= P;
        }
    }

    int ans = 0;
    for(int i = 1; i <= n + 1; i ++)
        for(int j = 0; j <= n; j ++)
            ans = (ans + i * ((i64)dp[i - 1][j] * pp[i + 1][n - j]) % P) % P;
    cout << ans << "\n";
}