



from math import loga


def    lowerCamelCase_(lowerCamelCase_    ) ->       int:
						if a < 0:
												raise ValueError("Input value must be a positive integer"    )
						elif isinstance(lowerCamelCase_    ,   lowerCamelCase_    ):
												raise TypeError("Input value must be a 'int' type"    )
						return 0 if (a == 0) else int(loga(a & -a    )    )


if __name__ == "__main__":
		import doctest

		doctest.testmod()








from __future__ import annotations

def    lowerCamelCase_(lowerCamelCase_    ) ->       int:
						UpperCAmelCase         =     len(lowerCamelCase_    ) // 2

						# choose the middle 3 elements
						UpperCAmelCase         =     lst[m - 1 : m + 2]

						# if middle element is peak
						if three[1] > three[0] and three[1] > three[2]:
												return three[1]

						# if increasing, recurse on right
						elif three[0] < three[2]:
												if len(lst[:m]    ) == 2:
																		m -= 1
												return peak(lst[m:]    )

						# decreasing
						else:
												if len(lst[:m]    ) == 2:
																		m += 1
												return peak(lst[:m]    )


if __name__ == "__main__":
		import doctest

		doctest.testmod()



