
'''simple docstring'''



def  _A		(							lowercase__	):



						if len(lowercase__	) == 1:
												return a[0], a[0]
						else:
												# split A into half.
												lowercase__							 =       a[: len(lowercase__	) // 2]
												lowercase__							 =       a[len(lowercase__	) // 2 :]

												# 2 sub problems, 1/2 of original size.
												lowercase__ ,						lowercase__							 =       max_difference(lowercase__	)
												lowercase__ ,						lowercase__							 =       max_difference(lowercase__	)

												# get min of first and max of second
												# linear time
												lowercase__							 =       min(lowercase__	)
												lowercase__							 =       max(lowercase__	)

												# 3 cases, either (small1, big1),
												# (min_first, max_second), (small2, big2)
												# constant comparisons
												if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
																		return smalla, biga
												elif biga - smalla > max_second - min_first:
																		return smalla, biga
												else:
																		return min_first, max_second


if __name__ == "__main__":
				import doctest

				doctest.testmod()

'''simple docstring'''



def  _A		(							lowercase__	):

						# validate:
						if not isinstance(lowercase__		,		lowercase__	) or not all(
						    isinstance(lowercase__		,		lowercase__	) and item >= 0 for item in citations	):
												raise ValueError("""The citations should be a list of non negative integers."""	)

						citations.sort()
						lowercase__							 =       len(lowercase__	)

						for i in range(lowercase__	):
												if citations[len_citations - 1 - i] <= i:
																		return i

						return len_citations


if __name__ == "__main__":
				import doctest

				doctest.testmod()






