





'''simple docstring'''







import sys





def 							lowerCamelCase_   (	SCREAMING_SNAKE_CASE__   :      int,      SCREAMING_SNAKE_CASE__   :      list[int] )			->						int:
						if not numbers:
												return 0
						if target == 0 and target in numbers:
												return 0
						if not isinstance(SCREAMING_SNAKE_CASE__,      (list, tuple) ) or not all(
						    isinstance(SCREAMING_SNAKE_CASE__,      SCREAMING_SNAKE_CASE__ ) for number in numbers ):
												raise ValueError('''numbers must be an iterable of integers''' )

						UpperCAmelCase_      :   List[Any]      =	0
						UpperCAmelCase_      :   Dict      =	sys.maxsize

						while right < len(SCREAMING_SNAKE_CASE__ ):
												curr_sum += numbers[right]
												while curr_sum >= target and left <= right:
																		UpperCAmelCase_      :   Optional[int]      =	min(SCREAMING_SNAKE_CASE__,      right - left + 1 )
																		curr_sum -= numbers[left]
																		left += 1
												right += 1

						return 0 if min_len == sys.maxsize else min_len







'''simple docstring'''





def   A			(							A_				:       int							):
						return n * (2 * n - 1)

def   A			(							A_				:       int							):
						snake_case							:  Optional[Any]			=     (1 + 24 * n) ** 0.5
						return ((1 + root) / 6) % 1 == 0

def   A			(							A_				:       int = 144							):
						snake_case							:  Any			=     start
						snake_case							:  Any			=     hexagonal_num(A_							)
						while not is_pentagonal(A_							):
												n += 1
												snake_case							:  Optional[Any]			=     hexagonal_num(A_							)
						return num


if __name__ == "__main__":
						print(f'''{solution()} = ''')

