sona m

def count_ways(num):
  p=[0]*(num+1)


  p[0]=1
  for i in range(1,num+1):
    k=1
    while ((k*(3*k-1))/2<=i):
      p[i] += ((1 if k % 2 else -1) *
                    p[i - (k * (3 * k - 1)) // 2])

      if (k > 0):
                k *= -1
      else:
                k = 1 - k

  return p[num]-1

# Driver code
if __name__ == "__main__":
    N = 3
    print(count_ways(N))