
class 			__A:




				def __init__(     self				)    ->      List[str]:


								'''simple docstring'''




								__a										=    ''''''
								__a										=    ''''''
								__a										=    []




				def 				SCREAMING_SNAKE_CASE_		(     self		,     _snake_case		,     _snake_case				)    ->      int:


								'''simple docstring'''




								if m == -1:
												return n + 1
								elif n == -1:
												return m + 1
								elif self.dp[m][n] > -1:
												return self.dp[m][n]
								else:
												if self.worda[m] == self.worda[n]:
																__a										=    self.__min_dist_top_down_dp(m - 1		,     n - 1				)
												else:
																__a										=    self.__min_dist_top_down_dp(_snake_case		,     n - 1				)
																__a										=    self.__min_dist_top_down_dp(m - 1		,     _snake_case				)
																__a										=    self.__min_dist_top_down_dp(m - 1		,     n - 1				)
																__a										=    1 + min(_snake_case		,     _snake_case		,     _snake_case				)

												return self.dp[m][n]




				def 				SCREAMING_SNAKE_CASE_		(     self		,     _snake_case		,     _snake_case				)    ->      int:


								'''simple docstring'''




								__a										=    worda
								__a										=    worda
								__a										=    [[-1 for _ in range(len(_snake_case				)				)] for _ in range(len(_snake_case				)				)]

								return self.__min_dist_top_down_dp(len(_snake_case				) - 1		,     len(_snake_case				) - 1				)




				def 				SCREAMING_SNAKE_CASE_		(     self		,     _snake_case		,     _snake_case				)    ->      int:


								'''simple docstring'''




								__a										=    worda
								__a										=    worda
								__a										=    len(_snake_case				)
								__a										=    len(_snake_case				)
								__a										=    [[0 for _ in range(n + 1				)] for _ in range(m + 1				)]

								for i in range(m + 1				):
												for j in range(n + 1				):
																if i == 0:  # first string is empty
																				__a										=    j
																elif j == 0:  # second string is empty
																				__a										=    i
																elif worda[i - 1] == worda[j - 1]:  # last characters are equal
																				__a										=    self.dp[i - 1][j - 1]
																else:
																				__a										=    self.dp[i][j - 1]
																				__a										=    self.dp[i - 1][j]
																				__a										=    self.dp[i - 1][j - 1]
																				__a										=    1 + min(_snake_case		,     _snake_case		,     _snake_case				)
								return self.dp[m][n]


if __name__ == "__main__":
					A     :	Dict    = EditDistance()

					print('****************** Testing Edit Distance DP Algorithm ******************')
					print()

					A     :	List[Any]    = input('Enter the first string: ').strip()
					A     :	Union[str, Any]    = input('Enter the second string: ').strip()

					print()
					print(F"The minimum edit distance is: {solver.min_dist_top_down(Sa, Sa)}")
					print(F"The minimum edit distance is: {solver.min_dist_bottom_up(Sa, Sa)}")
					print()
					print('*************** End of Testing Edit Distance DP Algorithm ***************')

from __future__ import annotations

import typing
from collections import Counter


def     __lowerCAmelCase			(			a__  )       ->  typing.Counter[int]:
				__a										=    Counter()
				for base in range(1						,    max_perimeter + 1  ):
								for perpendicular in range(a__						,    max_perimeter + 1  ):
												__a										=    (base * base + perpendicular * perpendicular) ** 0.5
												if hypotenuse == int(a__  ):
																__a										=    int(base + perpendicular + hypotenuse  )
																if perimeter > max_perimeter:
																				continue
																triplets[perimeter] += 1
				return triplets


def     __lowerCAmelCase			(			a__ = 1000  )       ->  int:
				__a										=    pythagorean_triple(a__  )
				return triplets.most_common(1  )[0][0]


if __name__ == "__main__":
					print(F"Perimeter {solution()} has maximum solutions")