


from collections import defaultdict
from math import gcd


def 			_UpperCamelCase				( lowercase__ = 1500000 ):
						__SCREAMING_SNAKE_CASE		:	Optional[Any]						     =						defaultdict(_lowerCAmelCase )
						__SCREAMING_SNAKE_CASE		:	List[str]						     =						2
						while 2 * euclid_m * (euclid_m + 1) <= limit:
												for euclid_n in range((euclid_m % 2) + 1       ,			_lowerCAmelCase       ,			2 ):
																		if gcd(_lowerCAmelCase       ,			_lowerCAmelCase ) > 1:
																								continue
																		__SCREAMING_SNAKE_CASE		:	str						     =						2 * euclid_m * (euclid_m + euclid_n)
																		for perimeter in range(_lowerCAmelCase       ,			limit + 1       ,			_lowerCAmelCase ):
																								frequencies[perimeter] += 1
												euclid_m += 1
						return sum(1 for frequency in frequencies.values() if frequency == 1 )


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


"""simple docstring"""
import os

def  lowercase     ():
						with open(os.path.dirname(_lowerCAmelCase						) + """/grid.txt"""						) as f:
												__lowerCAmelCase     =  []  # noqa: E741
												for _ in range(20						):
																		l.append([int(_lowerCAmelCase						) for x in f.readline().split()]						)

												__lowerCAmelCase     =  0

												# right
												for i in range(20						):
																		for j in range(17						):
																								__lowerCAmelCase     =  l[i][j] * l[i][j + 1] * l[i][j + 2] * l[i][j + 3]
																								if temp > maximum:
																														__lowerCAmelCase     =  temp

        # down
												for i in range(17						):
																		for j in range(20						):
																								__lowerCAmelCase     =  l[i][j] * l[i + 1][j] * l[i + 2][j] * l[i + 3][j]
																								if temp > maximum:
																														__lowerCAmelCase     =  temp

        # diagonal 1
												for i in range(17						):
																		for j in range(17						):
																								__lowerCAmelCase     =  l[i][j] * l[i + 1][j + 1] * l[i + 2][j + 2] * l[i + 3][j + 3]
																								if temp > maximum:
																														__lowerCAmelCase     =  temp

        # diagonal 2
												for i in range(17						):
																		for j in range(3 ,    20						):
																								__lowerCAmelCase     =  l[i][j] * l[i + 1][j - 1] * l[i + 2][j - 2] * l[i + 3][j - 3]
																								if temp > maximum:
																														__lowerCAmelCase     =  temp
												return maximum


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