



from __future__ import annotations

from PIL import Image

# Define glider example
lowercase  							=					[
    [0, 1, 0, 0, 0, 0, 0, 0],
    [0, 0, 1, 0, 0, 0, 0, 0],
    [1, 1, 1, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
]

# Define blinker example
lowercase  							=					[[0, 1, 0], [0, 1, 0], [0, 1, 0]]




def 	UpperCAmelCase     (		A	:						list[list[int]]       ):

		'''simple docstring'''


		_UpperCAmelCase							 =		[]
		for i in range(len(A       )       ):
				_UpperCAmelCase							 =		[]
				for j in range(len(cells[i]       )       ):
						# Get the number of live neighbours
						_UpperCAmelCase							 =		0
						if i > 0 and j > 0:
								neighbour_count += cells[i - 1][j - 1]
						if i > 0:
								neighbour_count += cells[i - 1][j]
						if i > 0 and j < len(cells[i]       ) - 1:
								neighbour_count += cells[i - 1][j + 1]
						if j > 0:
								neighbour_count += cells[i][j - 1]
						if j < len(cells[i]       ) - 1:
								neighbour_count += cells[i][j + 1]
						if i < len(A       ) - 1 and j > 0:
								neighbour_count += cells[i + 1][j - 1]
						if i < len(A       ) - 1:
								neighbour_count += cells[i + 1][j]
						if i < len(A       ) - 1 and j < len(cells[i]       ) - 1:
								neighbour_count += cells[i + 1][j + 1]

						# Rules of the game of life (excerpt from Wikipedia):
						# 1. Any live cell with two or three live neighbours survives.
						# 2. Any dead cell with three live neighbours becomes a live cell.
						# 3. All other live cells die in the next generation.
						#    Similarly, all other dead cells stay dead.
						_UpperCAmelCase							 =		cells[i][j] == 1
						if (
						    (alive and 2 <= neighbour_count <= 3)
						    or not alive
						    and neighbour_count == 3
						):
								next_generation_row.append(1       )
						else:
								next_generation_row.append(0       )

				next_generation.append(A       )
		return next_generation




def 	UpperCAmelCase     (		A	:						list[list[int]]     ,				A	:						int       ):

		'''simple docstring'''


		_UpperCAmelCase							 =		[]
		for _ in range(A       ):
				# Create output image
				_UpperCAmelCase							 =		Image.new('RGB'     ,				(len(cells[0]       ), len(A       ))       )
				_UpperCAmelCase							 =		img.load()

				# Save cells to image
				for x in range(len(A       )       ):
						for y in range(len(cells[0]       )       ):
								_UpperCAmelCase							 =		255 - cells[y][x] * 255
								_UpperCAmelCase							 =		(colour, colour, colour)

        # Save image
				images.append(A       )
				_UpperCAmelCase							 =		new_generation(A       )
		return images


if __name__ == "__main__":
					lowercase  							=					generate_images(GLIDER, 16)
					images[0].save('''out.gif''', save_all=True, append_images=images[1:])







"""simple docstring"""





import os




def 	UpperCAmelCase     (		):

		'''simple docstring'''


		_UpperCAmelCase							 =		os.path.join(os.path.dirname(A       )     ,				'num.txt'       )
		with open(A       ) as file_hand:
				return str(sum(int(A       ) for line in file_hand       )       )[:10]


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


