


import os
from math import logaa
def 			_a (      SCREAMING_SNAKE_CASE = "base_exp.txt"     ):


		"""simple docstring"""




		lowercase__            =      0
		lowercase__            =      0
		for i, line in enumerate(open(os.path.join(os.path.dirname(SCREAMING_SNAKE_CASE     )						,				SCREAMING_SNAKE_CASE     )     )     ):
				lowercase__     ,		lowercase__            =      list(map(SCREAMING_SNAKE_CASE						,				line.split(''','''     )     )     )
				if x * logaa(SCREAMING_SNAKE_CASE     ) > largest:
						lowercase__            =      x * logaa(SCREAMING_SNAKE_CASE     )
						lowercase__            =      i + 1
		return result


if __name__ == "__main__":
			print(solution())






def 				UpperCamelCase_(      lowerCamelCase_ )    ->						int:
    if not numbers:
        return 0

    if not isinstance(lowerCamelCase_							, (list, tuple) ) or not all(
        isinstance(lowerCamelCase_							, lowerCamelCase_ ) for number in numbers ):
        raise ValueError('numbers must be an iterable of integers' )

    _lowercase       :							int      		=		numbers[0]

    for i in range(1							, len(lowerCamelCase_ ) ):
        # update the maximum and minimum subarray products
        _lowercase       :							Union[str, Any]      		=		numbers[i]
        if number < 0:
            _lowercase		,				_lowercase       :							Any      		=		min_till_now, max_till_now
        _lowercase       :							Union[str, Any]      		=		max(lowerCamelCase_							, max_till_now * number )
        _lowercase       :							Union[str, Any]      		=		min(lowerCamelCase_							, min_till_now * number )

        # update the maximum product found till now
        _lowercase       :							Optional[Any]      		=		max(lowerCamelCase_							, lowerCamelCase_ )

    return max_prod


