def valid?(current, stride, n)
  return false if current > n
  diff = n - current
  diff % stride == 0
end

r, g, b, n = gets.split.map(&:to_i)
nums = [r, g, b]
nums = nums.sort.reverse
maxes = nums.map do |num|
  ((n + num - 1) / num).to_i
end
ans = 0
count = 0
while count <= n
  rest = n - count
  c2 = 0
  valids = []
  while c2 <= rest && valids.length < 2
    if valid?(c2 + count, nums[2], n)
      valids << c2
    end
    c2 += nums[1]
  end
  if valids.length == 1
    ans += 1
  elsif valids.length == 2
    diff = valids[1] - valids[0]
    r = rest - valids[1]
    ans += 2
    ans += (r / diff)
  end
  count += nums[0]
end

puts ans
