
import os



def 		lowercase_    (     A__ = "matrix.txt"	)							->							int:
    """simple docstring"""

    with open(os.path.join(os.path.dirname(A__	)				,	A__	)	) as in_file:
        snake_case				  =      in_file.read()

    snake_case				  =      [[int(A__	) for cell in row.split(","	)] for row in data.strip().splitlines()]
    snake_case				  =      [[0 for cell in row] for row in grid]
    snake_case				  =      len(grid[0]	)

    snake_case				  =      [[0 for i in range(A__	)] for j in range(A__	)]
    snake_case				  =      grid[0][0]
    for i in range(1				,	A__	):
        snake_case				  =      grid[0][i] + dp[0][i - 1]
    for i in range(1				,	A__	):
        snake_case				  =      grid[i][0] + dp[i - 1][0]

    for i in range(1				,	A__	):
        for j in range(1				,	A__	):
            snake_case				  =      grid[i][j] + min(dp[i - 1][j]				,	dp[i][j - 1]	)

    return dp[-1][-1]


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



def 		lowercase_    (     A__ = 1000	)							->							int:
    """simple docstring"""

    snake_case				  =      -1
    snake_case				  =      0
    for a in range(1				,	n // 3	):
        # Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
        snake_case				  =      (n * n - 2 * a * n) // (2 * n - 2 * a)
        snake_case				  =      n - a - b
        if c * c == (a * a + b * b):
            snake_case				  =      a * b * c
            if candidate >= product:
                snake_case				  =      candidate
    return product


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

