





'''simple docstring'''



from __future__ import annotations




def 				_lowerCAmelCase  (			lowerCamelCase_     :					int = 4			):
			__lowercase			  =							abs(lowerCamelCase_			) or 4
			return [[1 + x + y * row_size for x in range(lowerCamelCase_			)] for y in range(lowerCamelCase_			)]




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[list[int]]			):
			return reverse_row(transpose(lowerCamelCase_			)			)
			# OR.. transpose(reverse_column(matrix))




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[list[int]]			):
			return reverse_row(reverse_column(lowerCamelCase_			)			)
			# OR.. reverse_column(reverse_row(matrix))




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[list[int]]			):
			return reverse_column(transpose(lowerCamelCase_			)			)
			# OR.. transpose(reverse_row(matrix))




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[list[int]]			):
			__lowercase			  =							[list(lowerCamelCase_			) for x in zip(*lowerCamelCase_			)]
			return matrix




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[list[int]]			):
			__lowercase			  =							matrix[::-1]
			return matrix




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[list[int]]			):
			__lowercase			  =							[x[::-1] for x in matrix]
			return matrix




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list[list[int]]			):
			for i in matrix:
						print(*lowerCamelCase_			)


if __name__ == "__main__":
	_SCREAMING_SNAKE_CASE   =      make_matrix()
	print('''\norigin:\n''')
	print_matrix(matrix)
	print('''\nrotate 90 counterclockwise:\n''')
	print_matrix(rotate_aa(matrix))

	_SCREAMING_SNAKE_CASE   =      make_matrix()
	print('''\norigin:\n''')
	print_matrix(matrix)
	print('''\nrotate 180:\n''')
	print_matrix(rotate_aaa(matrix))

	_SCREAMING_SNAKE_CASE   =      make_matrix()
	print('''\norigin:\n''')
	print_matrix(matrix)
	print('''\nrotate 270 counterclockwise:\n''')
	print_matrix(rotate_aaa(matrix))












'''simple docstring'''



def 				_lowerCAmelCase  (			lowerCamelCase_     :					Union[str, Any]			):
			__lowercase			  =							1
			__lowercase			  =							2
			while i * i <= n:
						__lowercase			  =							0
						while n % i == 0:
									n //= i
									multiplicity += 1
						n_divisors *= multiplicity + 1
						i += 1
			if n > 1:
						n_divisors *= 2
			return n_divisors




def 				_lowerCAmelCase  (			):
			__lowercase			  =							1
			__lowercase			  =							1

			while True:
						i += 1
						t_num += i

						if count_divisors(lowerCamelCase_			) > 5_0_0:
									break

			return t_num


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





