





'''simple docstring'''



def 				_lowerCAmelCase  (			lowerCamelCase_     :					list			):

			if not grid or not grid[0]:
						raise TypeError('''The grid does not contain the appropriate information'''			)

			for cell_n in range(1						,    len(grid[0]			)			):
						grid[0][cell_n] += grid[0][cell_n - 1]
			__lowercase			  =							grid[0]

			for row_n in range(1						,    len(lowerCamelCase_			)			):
						__lowercase			  =							grid[row_n]
						__lowercase			  =							fill_row(lowerCamelCase_						,    lowerCamelCase_			)
						__lowercase			  =							grid[row_n]

			return grid[-1][-1]




def 				_lowerCAmelCase  (			lowerCamelCase_     :					list						,    lowerCamelCase_     :					list			):
			current_row[0] += row_above[0]
			for cell_n in range(1						,    len(lowerCamelCase_			)			):
						current_row[cell_n] += min(current_row[cell_n - 1]						,    row_above[cell_n]			)

			return current_row


if __name__ == "__main__":
	import doctest

	doctest.testmod()












'''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())





