#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #define CLR(a,b) memset((a),(b),sizeof((a)))

 using namespace std;

 const int inf = 0x3f3f3f3f;

 const int mod = 1e9 + ;

 const int N = ;

 int n;

 long long dp[][*N];//i个数和为j的数量

 int main(){

     int i, j, k;

     long long sum, ans;

     scanf("%d", &n);

     CLR(dp, );

     for(i = ; i <= ; ++i)

         dp[][i] = ;

     for(i = ; i <= n; ++i){

         for(j = ; j <= *i; ++j){

             sum = ;

             for(k = ; k <= ; ++k){

                 if(j >= k)

                     sum = (sum + dp[(i-)&][j-k]) % mod;

             }

             dp[i&][j] = sum;

         }

     }

     ans = ;

     for(i = ; i <= *n; ++i){

         ans = (ans + (dp[n&][i]-dp[(n-)&][i]) *dp[n&][i]) %mod;

     }

     printf("%d\n", ans);

     return ;

 }