#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;

const int size = 301;
int P[size];
int PC;
int dp[size];

int main() {
    for ( int i = 0; i <= 17; ++ i ) {
        P[PC++] = ( i + 1 ) * ( i + 1 );
    }
    
    for ( int i = 0; i < size; ++ i ) {
        dp[i] = 0;
    }
    dp[0] = 1;
    for ( int i = 0; i < PC; ++ i ) {
        for ( int j = 0; j < size; ++ j ) {
            int next = j + P[i];
            if ( next >= size ) continue;
            dp[next] += dp[j];
        }
    }
    
    int n;
    while ( cin >> n && n ) {
        cout << dp[n] << endl;
    }
    return 0;
}
### Prompt

Please formulate a cpp solution to the following problem:

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 <sstream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;

const int size = 301;
int P[size];
int PC;
int dp[size];

int main() {
    for ( int i = 0; i <= 17; ++ i ) {
        P[PC++] = ( i + 1 ) * ( i + 1 );
    }
    
    for ( int i = 0; i < size; ++ i ) {
        dp[i] = 0;
    }
    dp[0] = 1;
    for ( int i = 0; i < PC; ++ i ) {
        for ( int j = 0; j < size; ++ j ) {
            int next = j + P[i];
            if ( next >= size ) continue;
            dp[next] += dp[j];
        }
    }
    
    int n;
    while ( cin >> n && n ) {
        cout << dp[n] << endl;
    }
    return 0;
}
```