#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
using namespace std;
#define root 1,n,1
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define lr rt<<1
#define rr rt<<1|1
typedef long long LL;
typedef pair<int,int>pii;
#define X first
#define Y second
const int oo = 1e9+7;
const double PI = acos(-1.0);
const double eps = 1e-6 ;
const int N = 305 ;
const int mod = 1e9+7;
LL dp[N][N];
int n ;
void init() {
    dp[0][0] = 1 ;
    for( int i = 1 ; i <= 17 ; ++i ){
        for( int j = 0 ; j < N ; ++j ){
            for( int k = 0 ; k <= j ; k += i * i ){
                dp[i][j] += dp[i-1][j-k];
            }
        }
    }
}
void Run() {
    if( !n ) return ;
    cout << dp[17][n] << endl;
}
int main()
{
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
    #endif // LOCAL
    ios::sync_with_stdio(false);
    init(); while( cin >> n ) Run();
}