import os





def 							UpperCAmelCase		(       lowercase				):







				"""simple docstring"""



				__lowercase					     =				len(grid[0]				)
				__lowercase					     =				len(lowercase				)

				__lowercase					     =				0
				__lowercase					     =				0
				__lowercase					     =				0

				# Check vertically, horizontally, diagonally at the same time (only works
				# for nxn grid)
				for i in range(lowercase				):
								for j in range(n_rows - 3				):
												__lowercase					     =				grid[j][i] * grid[j + 1][i] * grid[j + 2][i] * grid[j + 3][i]
												__lowercase					     =				grid[i][j] * grid[i][j + 1] * grid[i][j + 2] * grid[i][j + 3]

												# Left-to-right diagonal (\) product
												if i < n_columns - 3:
																__lowercase					     =				(
																    grid[i][j]
																    * grid[i + 1][j + 1]
																    * grid[i + 2][j + 2]
																    * grid[i + 3][j + 3]
																)

												# Right-to-left diagonal(/) product
												if i > 2:
																__lowercase					     =				(
																    grid[i][j]
																    * grid[i - 1][j + 1]
																    * grid[i - 2][j + 2]
																    * grid[i - 3][j + 3]
																)

												__lowercase					     =				max(
												    lowercase				,     lowercase				,     lowercase				,     lowercase				)
												if max_product > largest:
																__lowercase					     =				max_product

				return largest





def 							UpperCAmelCase		(       ):







				"""simple docstring"""



				__lowercase					     =				[]
				with open(os.path.dirname(lowercase				) + '''/grid.txt'''				) as file:
								for line in file:
												grid.append(line.strip('''\n'''				).split(''' '''				)				)

				__lowercase					     =				[[int(lowercase				) for i in grid[j]] for j in range(len(lowercase				)				)]

				return largest_product(lowercase				)


if __name__ == "__main__":
		print(solution())
def 							UpperCAmelCase		(       lowercase				,     lowercase				):







				"""simple docstring"""



				__lowercase					     =				word.split()

				def justify(lowercase				,     lowercase				,     lowercase				) -> str:
								__lowercase					     =				max_width - width
								__lowercase					     =				len(lowercase				)
								if len(lowercase				) == 1:
												# if there is only word in line
												# just insert overall_spaces_count for the remainder of line
												return line[0] + " " * overall_spaces_count
								else:
												__lowercase					     =				words_count - 1
												# num_spaces_between_words_list[i] : tells you to insert
												# num_spaces_between_words_list[i] spaces
												# after word on line[i]
												__lowercase					     =				spaces_to_insert_between_words * [
												    overall_spaces_count // spaces_to_insert_between_words
												]
												__lowercase					     =				(
												    overall_spaces_count % spaces_to_insert_between_words
												)
												# distribute spaces via round robin to the left words
												for i in range(lowercase				):
																num_spaces_between_words_list[i] += 1
												__lowercase					     =				[]
												for i in range(lowercase				):
																# add the word
																aligned_words_list.append(line[i]				)
																# add the spaces to insert
																aligned_words_list.append(num_spaces_between_words_list[i] * ''' '''				)
												# just add the last word to the sentence
												aligned_words_list.append(line[-1]				)
												# join the aligned words list to form a justified line
												return "".join(lowercase				)

				__lowercase					     =				[]
				__lowercase					     =				[]
				__lowercase					     =				0
				for word in words:
								if width + len(lowercase				) + len(lowercase				) <= max_width:
												# keep adding words until we can fill out max_width
												# width = sum of length of all words (without overall_spaces_count)
												# len(word) = length of current word
												# len(line) = number of overall_spaces_count to insert between words
												line.append(lowercase				)
												width += len(lowercase				)
								else:
												# justify the line and add it to result
												answer.append(justify(lowercase				,     lowercase				,     lowercase				)				)
												# reset new line and new width
												__lowercase     ,	__lowercase					     =				[word], len(lowercase				)
				__lowercase					     =				max_width - width - len(lowercase				)
				answer.append(''' '''.join(lowercase				) + (remaining_spaces + 1) * ''' '''				)
				return answer


if __name__ == "__main__":
		from doctest import testmod

		testmod()