text: #include <algorithm>
  #include <bitset>
  #include <cassert>
  #include <cctype>
  #include <climits>
  #include <cmath>
  #include <cstdio>
  #include <cstdlib>
  #include <cstring>
  #include <fstream>
  #include <iostream>
  #include <iomanip>
  #include <iterator>
  #include <list>
  #include <map>
  #include <numeric>
  #include <queue>
  #include <set>
  #include <sstream>
  #include <stack>
  #include <string>
  #include <utility>
  #include <vector>
  using namespace std;
  
  
  const double EPS = 1e-9;
  const int INF = 0x7f7f7f7f;
  const double PI=acos(-1.0);
  
  #define    READ(f) 	         freopen(f, "r", stdin)
  #define    WRITE(f)   	     freopen(f, "w", stdout)
  
  #define    MP(x, y) 	     make_pair(x, y)
  #define    SZ(c) 	         (int)c.size()
  #define    PB(x)             push_back(x)
  
  #define    F(i,L,R)	         for (int i = L; i < R; i++)
  #define    FF(i,L,R) 	     for (int i = L; i <= R; i++)
  #define    FR(i,L,R) 	     for (int i = L; i > R; i--)
  #define    FRF(i,L,R) 	     for (int i = L; i >= R; i--)
  #define    FOREACH(i,t)      for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
  #define    ALL(p) 	         p.begin(),p.end()
  #define    ALLR(p) 	         p.rbegin(),p.rend()
  
  #define    SET(p) 	         memset(p, -1, sizeof(p))
  #define    CLR(p)            memset(p, 0, sizeof(p))
  #define    MEM(p, v)         memset(p, v, sizeof(p))
  #define    CPY(d, s)         memcpy(d, s, sizeof(s))
  
  #define    getI(a) 	         scanf("%d", &a)
  #define    getII(a,b) 	     scanf("%d %d", &a, &b)
  #define    getIII(a,b,c)     scanf("%d %d %d", &a, &b, &c)
  #define    getL(a)           scanf("%lld",&a)
  #define    getLL(a,b)        scanf("%lld %lld",&a,&b)
  #define    getLLL(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
  #define    getC(n)           scanf("%c",&n)
  #define    getF(n)           scanf("%lf",&n)
  #define    getS(n)           scanf("%s",n)
  
  #define    vi 	 vector < int >
  #define    vii 	 vector < vector < int > >
  #define    pii 	 pair< int, int >
  #define    psi 	 pair< string, int >
  #define    ff 	 first
  #define    ss 	 second
  #define    ll	 long long
  #define    ull 	 unsigned long long
  #define    ui    unsigned int
  #define    us 	 unsigned short
  #define    ld 	 long double
  
  
  template< class T > inline T _abs(T n) { return ( (n) < 0 ? -(n) : (n) ); }
  template< class T > inline T _max(T a, T b) { return ( ! ( (a) < (b) ) ? (a) : (b) ) ; }
  template< class T > inline T _min(T a, T b) { return ( ( (a) < (b) ) ? (a) : (b) ) ; }
  template< class T > inline T _swap(T &a, T &b) { T temp=a;a=b;b=temp;}
  template< class T > inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd( (b), ( (a) % (b) ) ) ; }
  template< class T > inline T lcm(T a, T b) { return ( (a) / gcd( (a), (b) ) * (b) ); }
  
  
  //******************DELETE****************
  #define shubhashi
  #ifdef shubhashis
       #define debug(args...) {dbg,args; cerr<<endl;}
  #else
      #define debug(args...)  // Just strip off all debug tokens
  #endif
  
  struct debugger{
      template<typename T> debugger& operator , (const T& v){
          cerr<<v<<" ";
          return *this;
      }
  }dbg;
  //******************DELETE****************
  
  
  vector <int> coin;
  ll dp[24][10016];
  
  ll call(int i,int amount)
  {
      //debug(i,amount,coi);
      if(i==21)
      {
          if(amount==0) return 1;
          else return 0;
      }
      if(dp[i][amount]!=-1) return dp[i][amount];
      ll ret1=0,ret2=0;
      if(amount-coin[i]>=0)
      {
          ret1=call(i,amount-coin[i]);
      }
      ret2=call(i+1,amount);
      return dp[i][amount]=ret1+ret2;
  }
  
  int main() {
      //READ("in.txt");
      //WRITE("out.txt");
  
      int n;
      for(int i=1;i<=21;i++)
      {
          int k=i*i*i;
          coin.PB(k);
          //debug(coin[i-1]);
      }
      for(int i=0;i<24;i++)
      {
          for(int j=0;j<10016;j++)
          {
              dp[i][j]=-1;
          }
      }
      while(~getI(n))
      {
          printf("%lld\n",call(0,n));
      }
  
      return 0;
  }
  
  