#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 1e6 + 10, inf = 0x3f3f3f3f, mod = 1e9 + 7;
int dp[N];
void solve()
{
int n;
cin >> n;
dp[0] = 1;
for (int i = 1; i <= n; i++)
{
for (int j = i; j <= n; j++)
{ // j一定要大于i
dp[j] = (dp[j] + dp[j - i]) % mod;
}
}
cout << dp[n];
}
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T = 1;
while (T--)
{
solve();
}
return 0;
}
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 1e3 + 10, inf = 0x3f3f3f3f, mod = 1e9 + 7;
int dp[N][N]; // 表示和为i,j个数相加的方案数;
void solve()
{
int n;
cin >> n;
dp[0][0] = 1;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= i; j++)
{
dp[i][j] = (dp[i - 1][j - 1] + dp[i - j][j]) % mod;
}
}
int ans = 0;
for (int i = 1; i <= n; i++)
{
ans += dp[n][i];
}
cout << ans%mod << endl;
}
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T = 1;
while (T--)
{
solve();
}
return 0;
}