1.21题目翻译

题目链接：Ignatius and the Princess III | JXNUOJ

题目：

"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says.
"The second problem is, given an positive integer N, we define an equation like this:
  N=a[1]+a[2]+a[3]+...+a[m];
  a[i]>0,1<=m<=N;
My question is how many different equations you can find for a given N.
For example, assume N is 4, we can find:
  4 = 4;
  4 = 3 + 1;
  4 = 2 + 2;
  4 = 2 + 1 + 1;
  4 = 1 + 1 + 1 + 1;
so the result is 5 when N is 4. Note that "4 = 3 + 1" and "4 = 1 + 3" is the same in this problem. Now, you do it!"

输入：

The input contains several test cases. Each test case contains a positive integer N(1<=N<=120) which is mentioned above. The input is terminated by the end of file.

输出：

For each test case, you have to output a line contains an integer P which indicate the different equations you have found.

翻译：

“好吧，看起来第一个问题太简单了，之后我将要让你知道你是多么愚蠢”feng5166说道。

“第二个问题是，给你一个正整数N，我们定义一个如下的方程式，

N=a[1]+a[2]+a[3]+...+a[m];
  a[i]>0,1<=m<=N;”

“我的问题是给你一个N你可以找到多少个不同的方程式，例如假设N是4，我们可以找到

4 = 4;
  4 = 3 + 1;
  4 = 2 + 2;
  4 = 2 + 1 + 1;
  4 = 1 + 1 + 1 + 1;”

所以当N为4的时候答案是5.在这个问题里 "4 = 3 + 1" 和 "4 = 1 + 3"记作一个相同的解。

输入：

输入由多组测试数据组成，。每组测试数据包括一个上文提到的正整数N(1<=N<=120),输入在文件结尾处结束。

输出：

每组测试数据，你必须输出一行计算的不同的方程式个数的整数P的数据