#include<iostream>
#include<cstring>

using namespace std;

int dp[500][20];

int check(int sum,int i)
{
  //cout<<sum<<" "<<i<<endl;
  if(sum==0)
   return 1;   
  if(sum-(i*i)<0)
    return 0;
  if(i>17)
    return 0;
  int ans=0;
  if(dp[sum][i]!=-1)
    return dp[sum][i];

  ans+=check(sum-(i*i),i);
  ans+=check(sum,i+1); 

  dp[sum][i]=ans;
  return ans;
}

int main()
{
  int n;
  memset(dp,-1,sizeof(dp));
  for(;cin>>n,n;)
    {
      cout<<check(n,1)<<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<cstring>

using namespace std;

int dp[500][20];

int check(int sum,int i)
{
  //cout<<sum<<" "<<i<<endl;
  if(sum==0)
   return 1;   
  if(sum-(i*i)<0)
    return 0;
  if(i>17)
    return 0;
  int ans=0;
  if(dp[sum][i]!=-1)
    return dp[sum][i];

  ans+=check(sum-(i*i),i);
  ans+=check(sum,i+1); 

  dp[sum][i]=ans;
  return ans;
}

int main()
{
  int n;
  memset(dp,-1,sizeof(dp));
  for(;cin>>n,n;)
    {
      cout<<check(n,1)<<endl;
    }
}
```