#include <iostream>
#define int long long
using namespace std;
int n,m;
const int mod = 1e9+7;
/*整数划分
f[i][j] = f[i-1][j] + f[i-1][j-i] + f[i-1][j-2*i] +.....+ f[i-1][j-s*i];s是满足i*s<=j的最大值
f[i][j-i] = f[i-1][j-i] + f[i-1][j-2*i] +.....+ f[i-1][j-s*i];
所以
f[i][j] = f[i-1][j] + f[i][j-i];
又由完全背包问题优化,正着枚举:
f[j] = f[j] + f[j-i];
*/
const int N = 1010;
char a[N], b[N];
int f[N];
signed main() {
cin>>n;
f[0]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
f[j] = f[j] + f[j-i];
}
cout<<f[n]<<endl;
return 0;
}
01-27
632
09-07
1733