output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      R G B N
attempt: r, g, b, n = map(int, input().split())
  
  if r >= g and g >= b:
      pass
  elif r >= b and b >= g:
      temp = g
      g = b
      b = temp
  else:
      temp = r
      r = g
      g = temp
  
  if (r == 1 and g == 1) or (r == 1 and b == 1) or (g == 1 and b == 1):
      rg = [i + 1 for i in range(n + 1)]
  elif (
      (r == 1 and g == 2)
      or (r == 1 and b == 2)
      or (g == 1 and b == 2)
      or (r == 2 and g == 1)
      or (r == 2 and b == 1)
      or (g == 2 and b == 1)
  ):
      rg = [1 + i // 2 for i in range(n + 1)]
  else:
      rg = [0 for _ in range(n + 1)]
      ri = 0
      while ri <= n:
          gi = 0
          while gi <= n - ri:
              rg[ri + gi] += 1
              gi += g
          ri += r
  
  bi = 0
  result = 0
  
  while bi <= n:
      total = rg[n - bi]
      result += total
      bi += b
  
  print(result)
  
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"}]