int x,
value =0,
  if x < A[0]
	return -1

foreach n von A[0...n-1]
 value = value + A[n],
  if x >= value
	return n-1
  end if
end foreach
return n-1