dp hdu1398

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<vector>
#include<string.h>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#define ll long long
#define INF 0x7fffffff
#define MAX 0x3f3f3f3f
#define maxn 100005
#define ull unsigned long long
using namespace std;

int coi[20],f[305];

int main()
{
    int n,v,i;
    for(i=1;i<=17;i++)coi[i]=i*i;
    f[0]=1;//初始化
    for(i=1;i<=17;i++){
        for(v=coi[i];v<=300;v++){//从钱币面额到所需钱数
            f[v]+=f[v-coi[i]];
        }
    }
    while(~scanf("%d",&n)&&n){
        printf("%d\n",f[n]);
    }
    return 0;
}