#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<complex>
#include<string>
#include<cstring>

using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 10000000000000
#define MAX_OTURI 50005
#define all(x) x.begin(),x.end()
typedef pair<int,int> P;
typedef pair<int,P> PP;
int coin[17];
int dp[300];
int n;
int main()
{
	dp[0]=1;
	rep(i,17)coin[i]=(i+1)*(i+1);
	rep(i,17)
	{
		rep(j,300)
		{
			if(j>=coin[i])dp[j]+=dp[j-coin[i]];
		}
	}
	while(1)
	{
		cin>>n;
		if(n==0)break;
		cout<<dp[n]<<endl;
	}
	return 0;
}
### Prompt

Develop a solution in CPP to the problem described below:

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<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<complex>
#include<string>
#include<cstring>

using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 10000000000000
#define MAX_OTURI 50005
#define all(x) x.begin(),x.end()
typedef pair<int,int> P;
typedef pair<int,P> PP;
int coin[17];
int dp[300];
int n;
int main()
{
	dp[0]=1;
	rep(i,17)coin[i]=(i+1)*(i+1);
	rep(i,17)
	{
		rep(j,300)
		{
			if(j>=coin[i])dp[j]+=dp[j-coin[i]];
		}
	}
	while(1)
	{
		cin>>n;
		if(n==0)break;
		cout<<dp[n]<<endl;
	}
	return 0;
}
```