Ignatius and the Princess III，普通母函数题，也叫生成函数。整数拆分。打表做。详见本文具体内容

# 题目

Ignatius and the Princess III

# 限制

Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)

# 描述

“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];$

# 输出格式

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

# 思路

$$G(x)=(1+x+x^2+…)(1+x^2+x^4+…)(1+x^3+x^6+…)…(1+x^n+x^{2n}+…)$$