output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      R G B N
attempt: def li():
      return list(map(int, input().split()))
  
  
  def combination2(a, b, n):
      # print('call 2: ', a, b, n)
      com2 = 0
      a_quot = n // a + 1
      for j in range(a_quot):
          com2 = com2 + combination1(b, n - j * a)
      return com2
  
  
  def combination1(a, n):
      # print('call 1: ', a, n)
      if n % a == 0:
          return 1
      else:
          return 0
  
  
  [r, g, b, n] = li()
  r_quot = n // r + 1
  com_num = 0
  for i in range(r_quot):
      com_num = com_num + combination2(g, b, n - i * r)
  print(com_num)
  
problem_description: Statement
  
  Snuke has come to a store that sells boxes containing balls. The store sells
  the following three kinds of boxes:
  
    * Red boxes, each containing R red balls
    * Green boxes, each containing G green balls
    * Blue boxes, each containing B blue balls
  
  Snuke wants to get a total of exactly N balls by buying r red boxes, g green
  boxes and b blue boxes. How many triples of non-negative integers (r,g,b)
  achieve this?
samples: [{"input": "1 2 3 4", "output": "4\n    \n\nFour triples achieve the objective, as follows:\n\n  * (4,0,0)\n  * (2,1,0)\n  * (1,0,1)\n  * (0,2,0)\n\n* * *"}, {"input": "13 1 4 3000", "output": "87058"}]