#include<iostream>
#include<string.h>
using namespace std;

int coin[17];
int memo[301][17];

int calc(int n,int c) {
  if(memo[n][c] != 0) return memo[n][c];
  if(n==0) return 1;
  if(c>17 || n<0 || coin[c]>n) return 0;
  int a = calc(n-coin[c], c);
  int b = calc(n, c+1);
  memo[n-coin[c]][c] = a;
  memo[n][c+1] = b;
  return a+b;
}

int main() {
  memset(coin, 0, sizeof(coin));
  memset(memo, 0, sizeof(memo));
  for(int i=17; i>=0; --i)
    coin[i] = (i+1)*(i+1);

  int n;
  while(cin>>n, n) {
    cout<<calc(n,0)<<endl;
  }
}
### Prompt

Construct a cpp code solution to the problem outlined:

People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (= 172), i.e., 1-credit coins, 4-credit coins, 9-credit coins, ..., and 289-credit coins, are available in Silverland.

There are four combinations of coins to pay ten credits:

* ten 1-credit coins,
* one 4-credit coin and six 1-credit coins,
* two 4-credit coins and two 1-credit coins, and
* one 9-credit coin and one 1-credit coin.



Your mission is to count the number of ways to pay a given amount using coins of Silverland.



Input

The input consists of lines each containing an integer meaning an amount to be paid, followed by a line containing a zero. You may assume that all the amounts are positive and less than 300.

Output

For each of the given amount, one line containing a single integer representing the number of combinations of coins should be output. No other characters should appear in the output.

Example

Input

2
10
30
0


Output

1
4
27

### Response

```cpp
#include<iostream>
#include<string.h>
using namespace std;

int coin[17];
int memo[301][17];

int calc(int n,int c) {
  if(memo[n][c] != 0) return memo[n][c];
  if(n==0) return 1;
  if(c>17 || n<0 || coin[c]>n) return 0;
  int a = calc(n-coin[c], c);
  int b = calc(n, c+1);
  memo[n-coin[c]][c] = a;
  memo[n][c+1] = b;
  return a+b;
}

int main() {
  memset(coin, 0, sizeof(coin));
  memset(memo, 0, sizeof(memo));
  for(int i=17; i>=0; --i)
    coin[i] = (i+1)*(i+1);

  int n;
  while(cin>>n, n) {
    cout<<calc(n,0)<<endl;
  }
}
```