#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>

#define FOR(i,b,n) for(int i=b;i<n;i++)
#define RFOR(i,b,n) for(int i=n-1;i>=b;i--)
#define CLR(mat) memset(mat, 0, sizeof(mat))
#define NCLR(mat) memset(mat, -1, sizeof(mat))

using namespace std;

static const double EPS = 1e-9;
typedef long long ll;
typedef pair<int, int> paii;

int coin[18] = {0}; 
int n, res = 0;

void solve_rec(int sum, int i)
{
	if( i <= 17)
	{
		if( sum == n)
			res++;
		else if(sum < n)
		{
			solve_rec(sum+coin[i], i);
			solve_rec(sum, i+1);
		}
	}
	
	return;
}

int solve()
{
	res = 0;
	solve_rec(0, 1);
	return res;
}

void init()
{
	FOR(i, 1, 18)
	{
		coin[i] = i*i;
	}
	
	return;
}

int main()
{
	init();
	
	while(cin >> n, n)
	{
		cout << solve() << endl;
	}
	
	return 0;
}
### Prompt

Your challenge is to write 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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>

#define FOR(i,b,n) for(int i=b;i<n;i++)
#define RFOR(i,b,n) for(int i=n-1;i>=b;i--)
#define CLR(mat) memset(mat, 0, sizeof(mat))
#define NCLR(mat) memset(mat, -1, sizeof(mat))

using namespace std;

static const double EPS = 1e-9;
typedef long long ll;
typedef pair<int, int> paii;

int coin[18] = {0}; 
int n, res = 0;

void solve_rec(int sum, int i)
{
	if( i <= 17)
	{
		if( sum == n)
			res++;
		else if(sum < n)
		{
			solve_rec(sum+coin[i], i);
			solve_rec(sum, i+1);
		}
	}
	
	return;
}

int solve()
{
	res = 0;
	solve_rec(0, 1);
	return res;
}

void init()
{
	FOR(i, 1, 18)
	{
		coin[i] = i*i;
	}
	
	return;
}

int main()
{
	init();
	
	while(cin >> n, n)
	{
		cout << solve() << endl;
	}
	
	return 0;
}
```