#include<iostream>
using namespace std;
#define KMAX 17
#define VMAX 300
 
static const int K[17] = {1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289};
int T[KMAX][VMAX+1];
 
int main(){
    for ( int j = 0; j <= VMAX; j++ ) T[0][j] = 1;
    for ( int i = 0; i < KMAX; i++ ) T[i][0] = 1;
    for ( int i = 1; i < KMAX; i++ ){
    for ( int j = 1; j < K[i]; j++ ) T[i][j] = T[i-1][j];
    for ( int j = K[i]; j <= VMAX; j++ ){
        T[i][j] = T[i-1][j] + T[i][j-K[i]];
    }
    }
    int n;
    while( cin >> n && n ) cout << T[KMAX-1][n]  << 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>
using namespace std;
#define KMAX 17
#define VMAX 300
 
static const int K[17] = {1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289};
int T[KMAX][VMAX+1];
 
int main(){
    for ( int j = 0; j <= VMAX; j++ ) T[0][j] = 1;
    for ( int i = 0; i < KMAX; i++ ) T[i][0] = 1;
    for ( int i = 1; i < KMAX; i++ ){
    for ( int j = 1; j < K[i]; j++ ) T[i][j] = T[i-1][j];
    for ( int j = K[i]; j <= VMAX; j++ ){
        T[i][j] = T[i-1][j] + T[i][j-K[i]];
    }
    }
    int n;
    while( cin >> n && n ) cout << T[KMAX-1][n]  << endl;
}
```