



'''simple docstring'''


import sys

lowercase_      :				int   					=    (
    '''73167176531330624919225119674426574742355349194934'''
    '''96983520312774506326239578318016984801869478851843'''
    '''85861560789112949495459501737958331952853208805511'''
    '''12540698747158523863050715693290963295227443043557'''
    '''66896648950445244523161731856403098711121722383113'''
    '''62229893423380308135336276614282806444486645238749'''
    '''30358907296290491560440772390713810515859307960866'''
    '''70172427121883998797908792274921901699720888093776'''
    '''65727333001053367881220235421809751254540594752243'''
    '''52584907711670556013604839586446706324415722155397'''
    '''53697817977846174064955149290862569321978468622482'''
    '''83972241375657056057490261407972968652414535100474'''
    '''82166370484403199890008895243450658541227588666881'''
    '''16427171479924442928230863465674813919123162824586'''
    '''17866458359124566529476545682848912883142607690042'''
    '''24219022671055626321111109370544217506941658960408'''
    '''07198403850962455444362981230987879927244284909188'''
    '''84580156166097919133875499200524063689912560717606'''
    '''05886116467109405077541002256983155200055935729725'''
    '''71636269561882670428252483600823257530420752963450'''
)







def      SCREAMING_SNAKE_CASE				(				lowercase_    :      str = N						):
						lowercase        =							-sys.maxsize - 1
						for i in range(len(lowercase_						) - 12						):
												lowercase        =							1
												for j in range(13						):
																		product *= int(n[i + j]						)
												if product > largest_product:
																		lowercase        =							product
						return largest_product


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







'''simple docstring'''


def      SCREAMING_SNAKE_CASE				(				lowercase_    :      int ,  lowercase_    :      int ,  lowercase_    :      list[list[int]]						):

						def update_area_of_max_square(lowercase_    :      int ,  lowercase_    :      int						) -> int:
												# BASE CASE
												if row >= rows or col >= cols:
																		return 0

												lowercase        =							update_area_of_max_square(lowercase_ ,  col + 1						)
												lowercase        =							update_area_of_max_square(row + 1 ,  col + 1						)
												lowercase        =							update_area_of_max_square(row + 1 ,  lowercase_						)

												if mat[row][col]:
																		lowercase        =							1 + min([right, diagonal, down]						)
																		lowercase        =							max(largest_square_area[0] ,  lowercase_						)
																		return sub_problem_sol
												else:
																		return 0

						lowercase        =							[0]
						update_area_of_max_square(0 ,  0						)
						return largest_square_area[0]







def      SCREAMING_SNAKE_CASE				(				lowercase_    :      int ,  lowercase_    :      int ,  lowercase_    :      list[list[int]]						):

						def update_area_of_max_square_using_dp_array(
						    lowercase_    :      int ,  lowercase_    :      int ,  lowercase_    :      list[list[int]]						) -> int:
												if row >= rows or col >= cols:
																		return 0
												if dp_array[row][col] != -1:
																		return dp_array[row][col]

												lowercase        =							update_area_of_max_square_using_dp_array(lowercase_ ,  col + 1 ,  lowercase_						)
												lowercase        =							update_area_of_max_square_using_dp_array(row + 1 ,  col + 1 ,  lowercase_						)
												lowercase        =							update_area_of_max_square_using_dp_array(row + 1 ,  lowercase_ ,  lowercase_						)

												if mat[row][col]:
																		lowercase        =							1 + min([right, diagonal, down]						)
																		lowercase        =							max(largest_square_area[0] ,  lowercase_						)
																		lowercase        =							sub_problem_sol
																		return sub_problem_sol
												else:
																		return 0

						lowercase        =							[0]
						lowercase        =							[[-1] * cols for _ in range(lowercase_						)]
						update_area_of_max_square_using_dp_array(0 ,  0 ,  lowercase_						)

						return largest_square_area[0]







def      SCREAMING_SNAKE_CASE				(				lowercase_    :      int ,  lowercase_    :      int ,  lowercase_    :      list[list[int]]						):
						lowercase        =							[[0] * (cols + 1) for _ in range(rows + 1						)]
						lowercase        =							0
						for row in range(rows - 1 ,  -1 ,  -1						):
												for col in range(cols - 1 ,  -1 ,  -1						):
																		lowercase        =							dp_array[row][col + 1]
																		lowercase        =							dp_array[row + 1][col + 1]
																		lowercase        =							dp_array[row + 1][col]

																		if mat[row][col] == 1:
																								lowercase        =							1 + min(lowercase_ ,  lowercase_ ,  lowercase_						)
																								lowercase        =							max(dp_array[row][col] ,  lowercase_						)
																		else:
																								lowercase        =							0

						return largest_square_area







def      SCREAMING_SNAKE_CASE				(				lowercase_    :      int ,  lowercase_    :      int ,  lowercase_    :      list[list[int]]						):
						lowercase        =							[0] * (cols + 1)
						lowercase        =							[0] * (cols + 1)
						lowercase        =							0
						for row in range(rows - 1 ,  -1 ,  -1						):
												for col in range(cols - 1 ,  -1 ,  -1						):
																		lowercase        =							current_row[col + 1]
																		lowercase        =							next_row[col + 1]
																		lowercase        =							next_row[col]

																		if mat[row][col] == 1:
																								lowercase        =							1 + min(lowercase_ ,  lowercase_ ,  lowercase_						)
																								lowercase        =							max(current_row[col] ,  lowercase_						)
																		else:
																								lowercase        =							0
												lowercase        =							current_row

						return largest_square_area


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						print(largest_square_area_in_matrix_bottom_up(2, 2, [[1, 1], [1, 1]]))


